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.13_true-unreach-call.i.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 02:25:05,550 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 02:25:05,552 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 02:25:05,566 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 02:25:05,566 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 02:25:05,566 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 02:25:05,567 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 02:25:05,569 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 02:25:05,570 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 02:25:05,571 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 02:25:05,571 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 02:25:05,571 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 02:25:05,573 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 02:25:05,574 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 02:25:05,574 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 02:25:05,580 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 02:25:05,581 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 02:25:05,582 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 02:25:05,583 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 02:25:05,583 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 02:25:05,584 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 02:25:05,585 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 02:25:05,585 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 02:25:05,587 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 02:25:05,588 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 02:25:05,588 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 02:25:05,588 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 02:25:05,589 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 02:25:05,589 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 02:25:05,589 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 02:25:05,589 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 02:25:05,589 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:25:05,597 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 02:25:05,598 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 02:25:05,598 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 02:25:05,598 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 02:25:05,598 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 02:25:05,600 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 02:25:05,600 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 02:25:05,600 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 02:25:05,600 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 02:25:05,600 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 02:25:05,600 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 02:25:05,601 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 02:25:05,601 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 02:25:05,601 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 02:25:05,601 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 02:25:05,601 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 02:25:05,601 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 02:25:05,601 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 02:25:05,601 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 02:25:05,601 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 02:25:05,601 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 02:25:05,601 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 02:25:05,601 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 02:25:05,602 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 02:25:05,602 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 02:25:05,602 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 02:25:05,602 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 02:25:05,602 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 02:25:05,602 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 02:25:05,602 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 02:25:05,602 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 02:25:05,602 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 02:25:05,603 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 02:25:05,603 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 02:25:05,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 02:25:05,638 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 02:25:05,640 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 02:25:05,641 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 02:25:05,641 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 02:25:05,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.13_true-unreach-call.i.cil.c [2018-01-30 02:25:05,773 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 02:25:05,774 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 02:25:05,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 02:25:05,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 02:25:05,778 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 02:25:05,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:25:05" (1/1) ... [2018-01-30 02:25:05,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e239250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:05, skipping insertion in model container [2018-01-30 02:25:05,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:25:05" (1/1) ... [2018-01-30 02:25:05,790 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 02:25:05,823 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 02:25:05,942 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 02:25:05,983 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 02:25:05,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:05 WrapperNode [2018-01-30 02:25:05,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 02:25:05,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 02:25:05,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 02:25:05,991 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 02:25:05,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:05" (1/1) ... [2018-01-30 02:25:05,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:05" (1/1) ... [2018-01-30 02:25:06,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:05" (1/1) ... [2018-01-30 02:25:06,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:05" (1/1) ... [2018-01-30 02:25:06,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:05" (1/1) ... [2018-01-30 02:25:06,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:05" (1/1) ... [2018-01-30 02:25:06,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:05" (1/1) ... [2018-01-30 02:25:06,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 02:25:06,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 02:25:06,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 02:25:06,041 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 02:25:06,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:05" (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:25:06,083 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 02:25:06,083 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 02:25:06,084 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 02:25:06,084 INFO L136 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-01-30 02:25:06,084 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 02:25:06,084 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 02:25:06,084 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 02:25:06,084 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 02:25:06,084 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 02:25:06,084 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 02:25:06,084 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 02:25:06,084 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 02:25:06,084 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 02:25:06,084 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 02:25:06,085 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-01-30 02:25:06,085 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-01-30 02:25:06,085 INFO L128 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-01-30 02:25:06,085 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 02:25:06,085 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 02:25:06,085 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 02:25:06,361 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 02:25:06,361 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 02:25:07,879 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 02:25:07,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:25:07 BoogieIcfgContainer [2018-01-30 02:25:07,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 02:25:07,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 02:25:07,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 02:25:07,882 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 02:25:07,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:25:05" (1/3) ... [2018-01-30 02:25:07,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b55cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:25:07, skipping insertion in model container [2018-01-30 02:25:07,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:05" (2/3) ... [2018-01-30 02:25:07,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b55cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:25:07, skipping insertion in model container [2018-01-30 02:25:07,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:25:07" (3/3) ... [2018-01-30 02:25:07,884 INFO L107 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.13_true-unreach-call.i.cil.c [2018-01-30 02:25:07,889 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 02:25:07,895 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 02:25:07,923 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 02:25:07,923 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 02:25:07,923 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 02:25:07,924 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 02:25:07,924 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 02:25:07,924 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 02:25:07,924 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 02:25:07,924 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 02:25:07,924 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 02:25:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states. [2018-01-30 02:25:07,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-01-30 02:25:07,947 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:07,948 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] [2018-01-30 02:25:07,948 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:07,951 INFO L82 PathProgramCache]: Analyzing trace with hash -836072991, now seen corresponding path program 1 times [2018-01-30 02:25:07,952 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:07,952 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:07,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:07,986 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:07,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:08,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:08,601 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:25:08,602 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:08,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:08,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:08,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:08,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:08,612 INFO L87 Difference]: Start difference. First operand 606 states. Second operand 4 states. [2018-01-30 02:25:09,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:09,237 INFO L93 Difference]: Finished difference Result 1220 states and 1445 transitions. [2018-01-30 02:25:09,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:25:09,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-01-30 02:25:09,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:09,250 INFO L225 Difference]: With dead ends: 1220 [2018-01-30 02:25:09,250 INFO L226 Difference]: Without dead ends: 646 [2018-01-30 02:25:09,253 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:25:09,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-01-30 02:25:09,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 593. [2018-01-30 02:25:09,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-01-30 02:25:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 673 transitions. [2018-01-30 02:25:09,295 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 673 transitions. Word has length 164 [2018-01-30 02:25:09,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:09,296 INFO L432 AbstractCegarLoop]: Abstraction has 593 states and 673 transitions. [2018-01-30 02:25:09,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:09,296 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 673 transitions. [2018-01-30 02:25:09,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-01-30 02:25:09,298 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:09,298 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] [2018-01-30 02:25:09,298 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:09,299 INFO L82 PathProgramCache]: Analyzing trace with hash -664576169, now seen corresponding path program 1 times [2018-01-30 02:25:09,299 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:09,299 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:09,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:09,300 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:09,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:09,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:09,543 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:25:09,543 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:09,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:09,544 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:09,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:09,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:09,545 INFO L87 Difference]: Start difference. First operand 593 states and 673 transitions. Second operand 4 states. [2018-01-30 02:25:10,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:10,002 INFO L93 Difference]: Finished difference Result 1119 states and 1272 transitions. [2018-01-30 02:25:10,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:10,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2018-01-30 02:25:10,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:10,004 INFO L225 Difference]: With dead ends: 1119 [2018-01-30 02:25:10,005 INFO L226 Difference]: Without dead ends: 644 [2018-01-30 02:25:10,011 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:25:10,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-01-30 02:25:10,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 593. [2018-01-30 02:25:10,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-01-30 02:25:10,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 672 transitions. [2018-01-30 02:25:10,022 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 672 transitions. Word has length 199 [2018-01-30 02:25:10,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:10,022 INFO L432 AbstractCegarLoop]: Abstraction has 593 states and 672 transitions. [2018-01-30 02:25:10,022 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:10,022 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 672 transitions. [2018-01-30 02:25:10,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-01-30 02:25:10,024 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:10,024 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] [2018-01-30 02:25:10,024 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:10,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1225138461, now seen corresponding path program 1 times [2018-01-30 02:25:10,024 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:10,024 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:10,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:10,025 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:10,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:10,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:10,262 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:25:10,263 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:10,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:10,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:10,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:10,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:10,264 INFO L87 Difference]: Start difference. First operand 593 states and 672 transitions. Second operand 4 states. [2018-01-30 02:25:10,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:10,627 INFO L93 Difference]: Finished difference Result 1117 states and 1269 transitions. [2018-01-30 02:25:10,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:10,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2018-01-30 02:25:10,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:10,630 INFO L225 Difference]: With dead ends: 1117 [2018-01-30 02:25:10,630 INFO L226 Difference]: Without dead ends: 642 [2018-01-30 02:25:10,631 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:25:10,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-01-30 02:25:10,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 593. [2018-01-30 02:25:10,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-01-30 02:25:10,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 671 transitions. [2018-01-30 02:25:10,639 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 671 transitions. Word has length 200 [2018-01-30 02:25:10,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:10,639 INFO L432 AbstractCegarLoop]: Abstraction has 593 states and 671 transitions. [2018-01-30 02:25:10,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:10,639 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 671 transitions. [2018-01-30 02:25:10,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-01-30 02:25:10,641 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:10,641 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] [2018-01-30 02:25:10,641 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:10,641 INFO L82 PathProgramCache]: Analyzing trace with hash -2052062650, now seen corresponding path program 1 times [2018-01-30 02:25:10,641 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:10,641 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:10,642 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:10,642 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:10,642 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:10,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:10,819 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:25:10,819 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:10,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 02:25:10,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 02:25:10,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 02:25:10,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:25:10,820 INFO L87 Difference]: Start difference. First operand 593 states and 671 transitions. Second operand 5 states. [2018-01-30 02:25:12,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:12,745 INFO L93 Difference]: Finished difference Result 1123 states and 1279 transitions. [2018-01-30 02:25:12,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 02:25:12,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 201 [2018-01-30 02:25:12,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:12,747 INFO L225 Difference]: With dead ends: 1123 [2018-01-30 02:25:12,747 INFO L226 Difference]: Without dead ends: 648 [2018-01-30 02:25:12,748 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:25:12,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-01-30 02:25:12,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 640. [2018-01-30 02:25:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-01-30 02:25:12,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 725 transitions. [2018-01-30 02:25:12,756 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 725 transitions. Word has length 201 [2018-01-30 02:25:12,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:12,756 INFO L432 AbstractCegarLoop]: Abstraction has 640 states and 725 transitions. [2018-01-30 02:25:12,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 02:25:12,756 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 725 transitions. [2018-01-30 02:25:12,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-01-30 02:25:12,758 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:12,758 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] [2018-01-30 02:25:12,758 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:12,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1703830859, now seen corresponding path program 1 times [2018-01-30 02:25:12,758 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:12,758 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:12,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:12,759 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:12,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:12,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:13,032 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:25:13,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:13,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:13,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:13,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:13,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:13,034 INFO L87 Difference]: Start difference. First operand 640 states and 725 transitions. Second operand 4 states. [2018-01-30 02:25:13,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:13,386 INFO L93 Difference]: Finished difference Result 1206 states and 1370 transitions. [2018-01-30 02:25:13,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:13,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2018-01-30 02:25:13,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:13,388 INFO L225 Difference]: With dead ends: 1206 [2018-01-30 02:25:13,388 INFO L226 Difference]: Without dead ends: 684 [2018-01-30 02:25:13,388 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:25:13,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2018-01-30 02:25:13,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 640. [2018-01-30 02:25:13,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-01-30 02:25:13,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 724 transitions. [2018-01-30 02:25:13,396 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 724 transitions. Word has length 202 [2018-01-30 02:25:13,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:13,396 INFO L432 AbstractCegarLoop]: Abstraction has 640 states and 724 transitions. [2018-01-30 02:25:13,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:13,396 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 724 transitions. [2018-01-30 02:25:13,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-01-30 02:25:13,398 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:13,398 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] [2018-01-30 02:25:13,398 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:13,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1234075344, now seen corresponding path program 1 times [2018-01-30 02:25:13,398 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:13,398 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:13,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:13,399 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:13,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:13,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:13,525 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:25:13,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:13,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:13,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:13,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:13,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:13,527 INFO L87 Difference]: Start difference. First operand 640 states and 724 transitions. Second operand 4 states. [2018-01-30 02:25:13,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:13,731 INFO L93 Difference]: Finished difference Result 1205 states and 1368 transitions. [2018-01-30 02:25:13,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:13,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2018-01-30 02:25:13,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:13,733 INFO L225 Difference]: With dead ends: 1205 [2018-01-30 02:25:13,733 INFO L226 Difference]: Without dead ends: 683 [2018-01-30 02:25:13,734 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:25:13,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-01-30 02:25:13,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 640. [2018-01-30 02:25:13,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-01-30 02:25:13,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 723 transitions. [2018-01-30 02:25:13,741 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 723 transitions. Word has length 203 [2018-01-30 02:25:13,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:13,741 INFO L432 AbstractCegarLoop]: Abstraction has 640 states and 723 transitions. [2018-01-30 02:25:13,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:13,741 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 723 transitions. [2018-01-30 02:25:13,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-01-30 02:25:13,743 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:13,743 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-30 02:25:13,743 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:13,743 INFO L82 PathProgramCache]: Analyzing trace with hash 643370394, now seen corresponding path program 1 times [2018-01-30 02:25:13,743 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:13,743 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:13,744 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:13,744 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:13,744 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:13,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:25:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:25:13,943 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:13,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:13,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:13,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:13,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:13,944 INFO L87 Difference]: Start difference. First operand 640 states and 723 transitions. Second operand 4 states. [2018-01-30 02:25:14,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:14,169 INFO L93 Difference]: Finished difference Result 1204 states and 1366 transitions. [2018-01-30 02:25:14,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:14,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2018-01-30 02:25:14,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:14,171 INFO L225 Difference]: With dead ends: 1204 [2018-01-30 02:25:14,171 INFO L226 Difference]: Without dead ends: 682 [2018-01-30 02:25:14,172 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:25:14,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-01-30 02:25:14,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 640. [2018-01-30 02:25:14,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-01-30 02:25:14,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 722 transitions. [2018-01-30 02:25:14,178 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 722 transitions. Word has length 205 [2018-01-30 02:25:14,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:14,178 INFO L432 AbstractCegarLoop]: Abstraction has 640 states and 722 transitions. [2018-01-30 02:25:14,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:14,179 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 722 transitions. [2018-01-30 02:25:14,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-01-30 02:25:14,180 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:14,180 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] [2018-01-30 02:25:14,180 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:14,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1842401045, now seen corresponding path program 1 times [2018-01-30 02:25:14,180 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:14,181 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:14,181 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:14,181 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:14,181 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:14,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:14,395 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:25:14,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:14,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:14,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:14,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:14,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:14,396 INFO L87 Difference]: Start difference. First operand 640 states and 722 transitions. Second operand 4 states. [2018-01-30 02:25:14,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:14,615 INFO L93 Difference]: Finished difference Result 1196 states and 1357 transitions. [2018-01-30 02:25:14,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:14,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-01-30 02:25:14,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:14,617 INFO L225 Difference]: With dead ends: 1196 [2018-01-30 02:25:14,617 INFO L226 Difference]: Without dead ends: 674 [2018-01-30 02:25:14,618 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:25:14,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-01-30 02:25:14,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 640. [2018-01-30 02:25:14,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-01-30 02:25:14,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 721 transitions. [2018-01-30 02:25:14,624 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 721 transitions. Word has length 206 [2018-01-30 02:25:14,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:14,624 INFO L432 AbstractCegarLoop]: Abstraction has 640 states and 721 transitions. [2018-01-30 02:25:14,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:14,624 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 721 transitions. [2018-01-30 02:25:14,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-01-30 02:25:14,625 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:14,625 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:25:14,625 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:14,625 INFO L82 PathProgramCache]: Analyzing trace with hash -591175027, now seen corresponding path program 1 times [2018-01-30 02:25:14,625 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:14,625 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:14,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:14,626 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:14,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:14,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:14,737 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:25:14,737 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:14,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:14,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:14,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:14,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:14,738 INFO L87 Difference]: Start difference. First operand 640 states and 721 transitions. Second operand 4 states. [2018-01-30 02:25:14,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:14,944 INFO L93 Difference]: Finished difference Result 1195 states and 1355 transitions. [2018-01-30 02:25:14,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:14,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2018-01-30 02:25:14,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:14,946 INFO L225 Difference]: With dead ends: 1195 [2018-01-30 02:25:14,946 INFO L226 Difference]: Without dead ends: 673 [2018-01-30 02:25:14,947 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:25:14,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-01-30 02:25:14,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 640. [2018-01-30 02:25:14,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-01-30 02:25:14,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 720 transitions. [2018-01-30 02:25:14,954 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 720 transitions. Word has length 208 [2018-01-30 02:25:14,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:14,954 INFO L432 AbstractCegarLoop]: Abstraction has 640 states and 720 transitions. [2018-01-30 02:25:14,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:14,955 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 720 transitions. [2018-01-30 02:25:14,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-01-30 02:25:14,957 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:14,957 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-30 02:25:14,957 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:14,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1473383758, now seen corresponding path program 1 times [2018-01-30 02:25:14,957 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:14,957 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:14,958 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:14,958 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:14,958 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:14,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:15,284 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:25:15,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:15,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:15,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:15,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:15,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:15,285 INFO L87 Difference]: Start difference. First operand 640 states and 720 transitions. Second operand 4 states. [2018-01-30 02:25:15,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:15,468 INFO L93 Difference]: Finished difference Result 1172 states and 1329 transitions. [2018-01-30 02:25:15,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:15,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2018-01-30 02:25:15,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:15,470 INFO L225 Difference]: With dead ends: 1172 [2018-01-30 02:25:15,470 INFO L226 Difference]: Without dead ends: 650 [2018-01-30 02:25:15,471 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:25:15,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-01-30 02:25:15,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 640. [2018-01-30 02:25:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-01-30 02:25:15,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 719 transitions. [2018-01-30 02:25:15,477 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 719 transitions. Word has length 211 [2018-01-30 02:25:15,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:15,477 INFO L432 AbstractCegarLoop]: Abstraction has 640 states and 719 transitions. [2018-01-30 02:25:15,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:15,477 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 719 transitions. [2018-01-30 02:25:15,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-01-30 02:25:15,478 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:15,478 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] [2018-01-30 02:25:15,478 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:15,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1998690195, now seen corresponding path program 1 times [2018-01-30 02:25:15,478 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:15,478 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:15,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:15,479 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:15,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:15,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:25:15,560 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:25:15,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:15,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:25:15,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:25:15,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:25:15,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:25:15,562 INFO L87 Difference]: Start difference. First operand 640 states and 719 transitions. Second operand 3 states. [2018-01-30 02:25:15,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:15,852 INFO L93 Difference]: Finished difference Result 1168 states and 1324 transitions. [2018-01-30 02:25:15,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:25:15,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-01-30 02:25:15,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:15,854 INFO L225 Difference]: With dead ends: 1168 [2018-01-30 02:25:15,854 INFO L226 Difference]: Without dead ends: 646 [2018-01-30 02:25:15,855 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:25:15,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-01-30 02:25:15,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2018-01-30 02:25:15,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-01-30 02:25:15,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 725 transitions. [2018-01-30 02:25:15,861 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 725 transitions. Word has length 211 [2018-01-30 02:25:15,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:15,861 INFO L432 AbstractCegarLoop]: Abstraction has 646 states and 725 transitions. [2018-01-30 02:25:15,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:25:15,861 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 725 transitions. [2018-01-30 02:25:15,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-01-30 02:25:15,862 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:15,862 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] [2018-01-30 02:25:15,863 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:15,863 INFO L82 PathProgramCache]: Analyzing trace with hash -2036412813, now seen corresponding path program 1 times [2018-01-30 02:25:15,863 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:15,863 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:15,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:15,864 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:15,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:15,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:15,956 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:25:15,956 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:15,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:25:15,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:25:15,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:25:15,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:25:15,957 INFO L87 Difference]: Start difference. First operand 646 states and 725 transitions. Second operand 3 states. [2018-01-30 02:25:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:16,014 INFO L93 Difference]: Finished difference Result 1672 states and 1903 transitions. [2018-01-30 02:25:16,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:25:16,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-01-30 02:25:16,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:16,017 INFO L225 Difference]: With dead ends: 1672 [2018-01-30 02:25:16,017 INFO L226 Difference]: Without dead ends: 1150 [2018-01-30 02:25:16,017 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:25:16,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2018-01-30 02:25:16,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1150. [2018-01-30 02:25:16,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2018-01-30 02:25:16,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1295 transitions. [2018-01-30 02:25:16,030 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1295 transitions. Word has length 212 [2018-01-30 02:25:16,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:16,030 INFO L432 AbstractCegarLoop]: Abstraction has 1150 states and 1295 transitions. [2018-01-30 02:25:16,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:25:16,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1295 transitions. [2018-01-30 02:25:16,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-01-30 02:25:16,032 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:16,032 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] [2018-01-30 02:25:16,032 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:16,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1418150459, now seen corresponding path program 1 times [2018-01-30 02:25:16,032 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:16,032 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:16,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:16,033 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:16,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:16,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:16,194 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:25:16,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:16,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:16,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:16,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:16,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:16,195 INFO L87 Difference]: Start difference. First operand 1150 states and 1295 transitions. Second operand 4 states. [2018-01-30 02:25:16,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:16,857 INFO L93 Difference]: Finished difference Result 2868 states and 3260 transitions. [2018-01-30 02:25:16,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:16,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2018-01-30 02:25:16,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:16,862 INFO L225 Difference]: With dead ends: 2868 [2018-01-30 02:25:16,862 INFO L226 Difference]: Without dead ends: 1842 [2018-01-30 02:25:16,864 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:25:16,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2018-01-30 02:25:16,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1311. [2018-01-30 02:25:16,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2018-01-30 02:25:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1498 transitions. [2018-01-30 02:25:16,878 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1498 transitions. Word has length 270 [2018-01-30 02:25:16,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:16,878 INFO L432 AbstractCegarLoop]: Abstraction has 1311 states and 1498 transitions. [2018-01-30 02:25:16,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:16,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1498 transitions. [2018-01-30 02:25:16,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-01-30 02:25:16,880 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:16,880 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] [2018-01-30 02:25:16,880 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:16,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1602188607, now seen corresponding path program 1 times [2018-01-30 02:25:16,880 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:16,880 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:16,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:16,881 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:16,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:16,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:17,234 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:25:17,235 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:17,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:17,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:17,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:17,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:17,235 INFO L87 Difference]: Start difference. First operand 1311 states and 1498 transitions. Second operand 4 states. [2018-01-30 02:25:17,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:17,497 INFO L93 Difference]: Finished difference Result 2655 states and 3051 transitions. [2018-01-30 02:25:17,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:25:17,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2018-01-30 02:25:17,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:17,499 INFO L225 Difference]: With dead ends: 2655 [2018-01-30 02:25:17,499 INFO L226 Difference]: Without dead ends: 1468 [2018-01-30 02:25:17,501 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:25:17,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2018-01-30 02:25:17,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1378. [2018-01-30 02:25:17,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2018-01-30 02:25:17,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1582 transitions. [2018-01-30 02:25:17,515 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1582 transitions. Word has length 270 [2018-01-30 02:25:17,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:17,517 INFO L432 AbstractCegarLoop]: Abstraction has 1378 states and 1582 transitions. [2018-01-30 02:25:17,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:17,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1582 transitions. [2018-01-30 02:25:17,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-01-30 02:25:17,519 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:17,519 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] [2018-01-30 02:25:17,519 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:17,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1737857570, now seen corresponding path program 1 times [2018-01-30 02:25:17,520 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:17,520 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:17,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:17,520 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:17,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:17,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:17,696 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:25:17,696 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:17,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:17,697 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:17,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:17,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:17,697 INFO L87 Difference]: Start difference. First operand 1378 states and 1582 transitions. Second operand 4 states. [2018-01-30 02:25:17,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:17,971 INFO L93 Difference]: Finished difference Result 3081 states and 3537 transitions. [2018-01-30 02:25:17,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:17,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 273 [2018-01-30 02:25:17,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:17,974 INFO L225 Difference]: With dead ends: 3081 [2018-01-30 02:25:17,974 INFO L226 Difference]: Without dead ends: 1827 [2018-01-30 02:25:17,976 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:25:17,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2018-01-30 02:25:17,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1384. [2018-01-30 02:25:17,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1384 states. [2018-01-30 02:25:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1588 transitions. [2018-01-30 02:25:17,990 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1588 transitions. Word has length 273 [2018-01-30 02:25:17,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:17,990 INFO L432 AbstractCegarLoop]: Abstraction has 1384 states and 1588 transitions. [2018-01-30 02:25:17,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:17,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1588 transitions. [2018-01-30 02:25:17,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-01-30 02:25:17,991 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:17,992 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] [2018-01-30 02:25:17,992 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:17,992 INFO L82 PathProgramCache]: Analyzing trace with hash 709526692, now seen corresponding path program 1 times [2018-01-30 02:25:17,992 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:17,992 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:17,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:17,993 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:17,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:18,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:18,195 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:25:18,195 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:18,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:18,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:18,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:18,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:18,196 INFO L87 Difference]: Start difference. First operand 1384 states and 1588 transitions. Second operand 6 states. [2018-01-30 02:25:18,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:18,992 INFO L93 Difference]: Finished difference Result 5038 states and 5796 transitions. [2018-01-30 02:25:18,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:25:18,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 283 [2018-01-30 02:25:18,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:18,998 INFO L225 Difference]: With dead ends: 5038 [2018-01-30 02:25:18,998 INFO L226 Difference]: Without dead ends: 3778 [2018-01-30 02:25:19,000 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-30 02:25:19,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3778 states. [2018-01-30 02:25:19,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3778 to 1514. [2018-01-30 02:25:19,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1514 states. [2018-01-30 02:25:19,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1752 transitions. [2018-01-30 02:25:19,039 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1752 transitions. Word has length 283 [2018-01-30 02:25:19,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:19,040 INFO L432 AbstractCegarLoop]: Abstraction has 1514 states and 1752 transitions. [2018-01-30 02:25:19,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:19,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1752 transitions. [2018-01-30 02:25:19,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-01-30 02:25:19,041 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:19,041 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] [2018-01-30 02:25:19,041 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:19,041 INFO L82 PathProgramCache]: Analyzing trace with hash -341790424, now seen corresponding path program 1 times [2018-01-30 02:25:19,041 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:19,041 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:19,042 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:19,042 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:19,042 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:19,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:25:19,642 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:25:19,642 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:19,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:19,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:19,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:19,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:19,643 INFO L87 Difference]: Start difference. First operand 1514 states and 1752 transitions. Second operand 6 states. [2018-01-30 02:25:20,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:20,342 INFO L93 Difference]: Finished difference Result 4415 states and 5120 transitions. [2018-01-30 02:25:20,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 02:25:20,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 283 [2018-01-30 02:25:20,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:20,347 INFO L225 Difference]: With dead ends: 4415 [2018-01-30 02:25:20,347 INFO L226 Difference]: Without dead ends: 3025 [2018-01-30 02:25:20,349 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-30 02:25:20,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3025 states. [2018-01-30 02:25:20,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3025 to 1528. [2018-01-30 02:25:20,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2018-01-30 02:25:20,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 1767 transitions. [2018-01-30 02:25:20,370 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 1767 transitions. Word has length 283 [2018-01-30 02:25:20,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:20,370 INFO L432 AbstractCegarLoop]: Abstraction has 1528 states and 1767 transitions. [2018-01-30 02:25:20,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:20,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1767 transitions. [2018-01-30 02:25:20,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-01-30 02:25:20,372 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:20,372 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] [2018-01-30 02:25:20,372 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:20,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1788508882, now seen corresponding path program 1 times [2018-01-30 02:25:20,372 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:20,372 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:20,373 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:20,373 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:20,373 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:20,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:20,693 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:25:20,693 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:20,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:20,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:20,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:20,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:20,694 INFO L87 Difference]: Start difference. First operand 1528 states and 1767 transitions. Second operand 4 states. [2018-01-30 02:25:21,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:21,337 INFO L93 Difference]: Finished difference Result 3363 states and 3887 transitions. [2018-01-30 02:25:21,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:21,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 285 [2018-01-30 02:25:21,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:21,341 INFO L225 Difference]: With dead ends: 3363 [2018-01-30 02:25:21,341 INFO L226 Difference]: Without dead ends: 1959 [2018-01-30 02:25:21,342 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:25:21,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2018-01-30 02:25:21,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1588. [2018-01-30 02:25:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2018-01-30 02:25:21,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 1845 transitions. [2018-01-30 02:25:21,359 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 1845 transitions. Word has length 285 [2018-01-30 02:25:21,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:21,360 INFO L432 AbstractCegarLoop]: Abstraction has 1588 states and 1845 transitions. [2018-01-30 02:25:21,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:21,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 1845 transitions. [2018-01-30 02:25:21,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-01-30 02:25:21,361 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:21,361 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] [2018-01-30 02:25:21,361 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:21,362 INFO L82 PathProgramCache]: Analyzing trace with hash -2054458653, now seen corresponding path program 1 times [2018-01-30 02:25:21,362 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:21,362 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:21,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:21,362 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:21,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:21,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:21,654 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:25:21,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:21,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:21,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:21,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:21,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:21,655 INFO L87 Difference]: Start difference. First operand 1588 states and 1845 transitions. Second operand 6 states. [2018-01-30 02:25:22,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:22,353 INFO L93 Difference]: Finished difference Result 5235 states and 6051 transitions. [2018-01-30 02:25:22,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:25:22,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 286 [2018-01-30 02:25:22,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:22,360 INFO L225 Difference]: With dead ends: 5235 [2018-01-30 02:25:22,360 INFO L226 Difference]: Without dead ends: 3771 [2018-01-30 02:25:22,362 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-30 02:25:22,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3771 states. [2018-01-30 02:25:22,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3771 to 1594. [2018-01-30 02:25:22,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1594 states. [2018-01-30 02:25:22,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 1851 transitions. [2018-01-30 02:25:22,384 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 1851 transitions. Word has length 286 [2018-01-30 02:25:22,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:22,385 INFO L432 AbstractCegarLoop]: Abstraction has 1594 states and 1851 transitions. [2018-01-30 02:25:22,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:22,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 1851 transitions. [2018-01-30 02:25:22,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-01-30 02:25:22,386 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:22,386 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, 1, 1] [2018-01-30 02:25:22,386 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:22,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1760585687, now seen corresponding path program 1 times [2018-01-30 02:25:22,387 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:22,387 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:22,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:22,387 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:22,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:22,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:22,558 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:25:22,558 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:22,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:22,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:22,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:22,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:22,559 INFO L87 Difference]: Start difference. First operand 1594 states and 1851 transitions. Second operand 4 states. [2018-01-30 02:25:22,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:22,798 INFO L93 Difference]: Finished difference Result 3409 states and 3947 transitions. [2018-01-30 02:25:22,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:22,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 288 [2018-01-30 02:25:22,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:22,802 INFO L225 Difference]: With dead ends: 3409 [2018-01-30 02:25:22,802 INFO L226 Difference]: Without dead ends: 1939 [2018-01-30 02:25:22,803 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:25:22,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2018-01-30 02:25:22,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1600. [2018-01-30 02:25:22,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2018-01-30 02:25:22,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 1857 transitions. [2018-01-30 02:25:22,820 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 1857 transitions. Word has length 288 [2018-01-30 02:25:22,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:22,820 INFO L432 AbstractCegarLoop]: Abstraction has 1600 states and 1857 transitions. [2018-01-30 02:25:22,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:22,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 1857 transitions. [2018-01-30 02:25:22,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-01-30 02:25:22,823 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:22,823 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] [2018-01-30 02:25:22,823 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:22,823 INFO L82 PathProgramCache]: Analyzing trace with hash -903920529, now seen corresponding path program 1 times [2018-01-30 02:25:22,823 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:22,823 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:22,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:22,824 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:22,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:22,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:23,486 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:25:23,486 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:23,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:23,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:23,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:23,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:23,487 INFO L87 Difference]: Start difference. First operand 1600 states and 1857 transitions. Second operand 6 states. [2018-01-30 02:25:24,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:24,124 INFO L93 Difference]: Finished difference Result 5225 states and 6035 transitions. [2018-01-30 02:25:24,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:25:24,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 298 [2018-01-30 02:25:24,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:24,131 INFO L225 Difference]: With dead ends: 5225 [2018-01-30 02:25:24,131 INFO L226 Difference]: Without dead ends: 3749 [2018-01-30 02:25:24,133 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-30 02:25:24,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3749 states. [2018-01-30 02:25:24,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3749 to 1660. [2018-01-30 02:25:24,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2018-01-30 02:25:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 1935 transitions. [2018-01-30 02:25:24,157 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 1935 transitions. Word has length 298 [2018-01-30 02:25:24,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:24,157 INFO L432 AbstractCegarLoop]: Abstraction has 1660 states and 1935 transitions. [2018-01-30 02:25:24,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 1935 transitions. [2018-01-30 02:25:24,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-01-30 02:25:24,159 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:24,159 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, 1, 1] [2018-01-30 02:25:24,159 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:24,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1386677576, now seen corresponding path program 1 times [2018-01-30 02:25:24,159 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:24,159 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:24,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:24,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:24,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:24,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:24,415 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:25:24,415 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:24,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:24,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:24,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:24,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:24,416 INFO L87 Difference]: Start difference. First operand 1660 states and 1935 transitions. Second operand 6 states. [2018-01-30 02:25:24,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:24,974 INFO L93 Difference]: Finished difference Result 5259 states and 6083 transitions. [2018-01-30 02:25:24,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:25:24,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 301 [2018-01-30 02:25:24,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:24,979 INFO L225 Difference]: With dead ends: 5259 [2018-01-30 02:25:24,979 INFO L226 Difference]: Without dead ends: 3723 [2018-01-30 02:25:24,981 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-30 02:25:24,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2018-01-30 02:25:25,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 1492. [2018-01-30 02:25:25,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1492 states. [2018-01-30 02:25:25,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1717 transitions. [2018-01-30 02:25:25,006 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1717 transitions. Word has length 301 [2018-01-30 02:25:25,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:25,006 INFO L432 AbstractCegarLoop]: Abstraction has 1492 states and 1717 transitions. [2018-01-30 02:25:25,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:25,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1717 transitions. [2018-01-30 02:25:25,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-01-30 02:25:25,007 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:25,007 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] [2018-01-30 02:25:25,007 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:25,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1977807047, now seen corresponding path program 1 times [2018-01-30 02:25:25,008 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:25,008 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:25,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:25,008 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:25,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:25,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:25,250 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:25:25,250 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:25,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:25,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:25,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:25,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:25,251 INFO L87 Difference]: Start difference. First operand 1492 states and 1717 transitions. Second operand 4 states. [2018-01-30 02:25:25,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:25,476 INFO L93 Difference]: Finished difference Result 3369 states and 3891 transitions. [2018-01-30 02:25:25,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:25,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2018-01-30 02:25:25,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:25,479 INFO L225 Difference]: With dead ends: 3369 [2018-01-30 02:25:25,479 INFO L226 Difference]: Without dead ends: 2001 [2018-01-30 02:25:25,480 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:25:25,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2018-01-30 02:25:25,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1534. [2018-01-30 02:25:25,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1534 states. [2018-01-30 02:25:25,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 1771 transitions. [2018-01-30 02:25:25,500 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 1771 transitions. Word has length 306 [2018-01-30 02:25:25,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:25,500 INFO L432 AbstractCegarLoop]: Abstraction has 1534 states and 1771 transitions. [2018-01-30 02:25:25,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:25,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 1771 transitions. [2018-01-30 02:25:25,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-01-30 02:25:25,502 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:25,502 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] [2018-01-30 02:25:25,502 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:25,502 INFO L82 PathProgramCache]: Analyzing trace with hash -920064061, now seen corresponding path program 1 times [2018-01-30 02:25:25,502 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:25,502 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:25,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:25,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:25,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:25,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:25,662 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:25:25,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:25,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:25,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:25,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:25,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:25,663 INFO L87 Difference]: Start difference. First operand 1534 states and 1771 transitions. Second operand 4 states. [2018-01-30 02:25:25,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:25,849 INFO L93 Difference]: Finished difference Result 3066 states and 3556 transitions. [2018-01-30 02:25:25,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:25,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2018-01-30 02:25:25,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:25,851 INFO L225 Difference]: With dead ends: 3066 [2018-01-30 02:25:25,851 INFO L226 Difference]: Without dead ends: 1656 [2018-01-30 02:25:25,852 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:25:25,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2018-01-30 02:25:25,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1555. [2018-01-30 02:25:25,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:25:25,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1798 transitions. [2018-01-30 02:25:25,889 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1798 transitions. Word has length 306 [2018-01-30 02:25:25,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:25,889 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1798 transitions. [2018-01-30 02:25:25,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:25,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1798 transitions. [2018-01-30 02:25:25,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-01-30 02:25:25,891 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:25,891 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] [2018-01-30 02:25:25,891 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:25,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1130218393, now seen corresponding path program 1 times [2018-01-30 02:25:25,891 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:25,892 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:25,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:25,892 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:25,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:25,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:26,077 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:25:26,077 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:26,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:26,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:26,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:26,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:26,078 INFO L87 Difference]: Start difference. First operand 1555 states and 1798 transitions. Second operand 4 states. [2018-01-30 02:25:26,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:26,305 INFO L93 Difference]: Finished difference Result 3451 states and 3995 transitions. [2018-01-30 02:25:26,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:26,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2018-01-30 02:25:26,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:26,308 INFO L225 Difference]: With dead ends: 3451 [2018-01-30 02:25:26,308 INFO L226 Difference]: Without dead ends: 2020 [2018-01-30 02:25:26,309 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:25:26,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2018-01-30 02:25:26,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1555. [2018-01-30 02:25:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:25:26,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1796 transitions. [2018-01-30 02:25:26,330 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1796 transitions. Word has length 308 [2018-01-30 02:25:26,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:26,330 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1796 transitions. [2018-01-30 02:25:26,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:26,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1796 transitions. [2018-01-30 02:25:26,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-01-30 02:25:26,332 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:26,332 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] [2018-01-30 02:25:26,332 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:26,332 INFO L82 PathProgramCache]: Analyzing trace with hash -585108587, now seen corresponding path program 1 times [2018-01-30 02:25:26,332 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:26,332 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:26,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:26,333 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:26,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:26,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:26,494 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:25:26,495 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:26,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:26,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:26,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:26,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:26,495 INFO L87 Difference]: Start difference. First operand 1555 states and 1796 transitions. Second operand 4 states. [2018-01-30 02:25:26,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:26,668 INFO L93 Difference]: Finished difference Result 3086 states and 3577 transitions. [2018-01-30 02:25:26,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:26,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2018-01-30 02:25:26,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:26,670 INFO L225 Difference]: With dead ends: 3086 [2018-01-30 02:25:26,670 INFO L226 Difference]: Without dead ends: 1655 [2018-01-30 02:25:26,671 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:25:26,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2018-01-30 02:25:26,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1555. [2018-01-30 02:25:26,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:25:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1795 transitions. [2018-01-30 02:25:26,691 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1795 transitions. Word has length 308 [2018-01-30 02:25:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:26,691 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1795 transitions. [2018-01-30 02:25:26,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1795 transitions. [2018-01-30 02:25:26,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-01-30 02:25:26,692 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:26,693 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] [2018-01-30 02:25:26,693 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:26,693 INFO L82 PathProgramCache]: Analyzing trace with hash 722105548, now seen corresponding path program 1 times [2018-01-30 02:25:26,693 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:26,693 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:26,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:26,694 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:26,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:26,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:26,893 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:25:26,893 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:26,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:26,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:26,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:26,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:26,893 INFO L87 Difference]: Start difference. First operand 1555 states and 1795 transitions. Second operand 4 states. [2018-01-30 02:25:27,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:27,122 INFO L93 Difference]: Finished difference Result 3449 states and 3987 transitions. [2018-01-30 02:25:27,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:27,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2018-01-30 02:25:27,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:27,124 INFO L225 Difference]: With dead ends: 3449 [2018-01-30 02:25:27,124 INFO L226 Difference]: Without dead ends: 2018 [2018-01-30 02:25:27,125 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:25:27,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2018-01-30 02:25:27,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 1555. [2018-01-30 02:25:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:25:27,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1793 transitions. [2018-01-30 02:25:27,145 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1793 transitions. Word has length 309 [2018-01-30 02:25:27,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:27,145 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1793 transitions. [2018-01-30 02:25:27,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:27,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1793 transitions. [2018-01-30 02:25:27,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-01-30 02:25:27,147 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:27,147 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] [2018-01-30 02:25:27,147 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:27,147 INFO L82 PathProgramCache]: Analyzing trace with hash -913423280, now seen corresponding path program 1 times [2018-01-30 02:25:27,147 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:27,147 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:27,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:27,148 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:27,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:27,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:27,395 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:25:27,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:27,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:27,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:27,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:27,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:27,396 INFO L87 Difference]: Start difference. First operand 1555 states and 1793 transitions. Second operand 4 states. [2018-01-30 02:25:27,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:27,571 INFO L93 Difference]: Finished difference Result 3085 states and 3570 transitions. [2018-01-30 02:25:27,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:27,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2018-01-30 02:25:27,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:27,573 INFO L225 Difference]: With dead ends: 3085 [2018-01-30 02:25:27,573 INFO L226 Difference]: Without dead ends: 1654 [2018-01-30 02:25:27,574 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:25:27,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2018-01-30 02:25:27,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1555. [2018-01-30 02:25:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:25:27,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1792 transitions. [2018-01-30 02:25:27,593 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1792 transitions. Word has length 309 [2018-01-30 02:25:27,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:27,593 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1792 transitions. [2018-01-30 02:25:27,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:27,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1792 transitions. [2018-01-30 02:25:27,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-01-30 02:25:27,595 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:27,595 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] [2018-01-30 02:25:27,595 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:27,595 INFO L82 PathProgramCache]: Analyzing trace with hash -662468042, now seen corresponding path program 1 times [2018-01-30 02:25:27,595 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:27,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:27,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:27,596 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:27,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:27,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:27,763 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:25:27,763 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:27,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:27,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:27,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:27,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:27,764 INFO L87 Difference]: Start difference. First operand 1555 states and 1792 transitions. Second operand 4 states. [2018-01-30 02:25:28,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:28,039 INFO L93 Difference]: Finished difference Result 3447 states and 3979 transitions. [2018-01-30 02:25:28,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:28,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 311 [2018-01-30 02:25:28,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:28,041 INFO L225 Difference]: With dead ends: 3447 [2018-01-30 02:25:28,041 INFO L226 Difference]: Without dead ends: 2016 [2018-01-30 02:25:28,042 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:25:28,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states. [2018-01-30 02:25:28,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 1555. [2018-01-30 02:25:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:25:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1790 transitions. [2018-01-30 02:25:28,062 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1790 transitions. Word has length 311 [2018-01-30 02:25:28,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:28,062 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1790 transitions. [2018-01-30 02:25:28,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:28,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1790 transitions. [2018-01-30 02:25:28,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-01-30 02:25:28,064 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:28,064 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] [2018-01-30 02:25:28,064 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:28,064 INFO L82 PathProgramCache]: Analyzing trace with hash -447641414, now seen corresponding path program 1 times [2018-01-30 02:25:28,064 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:28,064 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:28,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:28,065 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:28,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:28,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:28,301 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:25:28,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:28,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:28,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:28,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:28,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:28,302 INFO L87 Difference]: Start difference. First operand 1555 states and 1790 transitions. Second operand 4 states. [2018-01-30 02:25:28,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:28,501 INFO L93 Difference]: Finished difference Result 3084 states and 3563 transitions. [2018-01-30 02:25:28,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:28,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 311 [2018-01-30 02:25:28,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:28,503 INFO L225 Difference]: With dead ends: 3084 [2018-01-30 02:25:28,503 INFO L226 Difference]: Without dead ends: 1653 [2018-01-30 02:25:28,504 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:25:28,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2018-01-30 02:25:28,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1555. [2018-01-30 02:25:28,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:25:28,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1789 transitions. [2018-01-30 02:25:28,526 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1789 transitions. Word has length 311 [2018-01-30 02:25:28,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:28,526 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1789 transitions. [2018-01-30 02:25:28,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:28,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1789 transitions. [2018-01-30 02:25:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-01-30 02:25:28,527 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:28,527 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] [2018-01-30 02:25:28,527 INFO L371 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:28,528 INFO L82 PathProgramCache]: Analyzing trace with hash 626280399, now seen corresponding path program 1 times [2018-01-30 02:25:28,528 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:28,528 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:28,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:28,528 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:28,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:28,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:28,696 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:25:28,697 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:28,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:28,697 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:28,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:28,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:28,697 INFO L87 Difference]: Start difference. First operand 1555 states and 1789 transitions. Second operand 4 states. [2018-01-30 02:25:28,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:28,948 INFO L93 Difference]: Finished difference Result 3431 states and 3957 transitions. [2018-01-30 02:25:28,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:28,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2018-01-30 02:25:28,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:28,949 INFO L225 Difference]: With dead ends: 3431 [2018-01-30 02:25:28,949 INFO L226 Difference]: Without dead ends: 2000 [2018-01-30 02:25:28,951 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:25:28,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2018-01-30 02:25:28,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1555. [2018-01-30 02:25:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:25:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1787 transitions. [2018-01-30 02:25:28,972 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1787 transitions. Word has length 312 [2018-01-30 02:25:28,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:28,972 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1787 transitions. [2018-01-30 02:25:28,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:28,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1787 transitions. [2018-01-30 02:25:28,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-01-30 02:25:28,974 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:28,974 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] [2018-01-30 02:25:28,974 INFO L371 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:28,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1304028725, now seen corresponding path program 1 times [2018-01-30 02:25:28,974 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:28,974 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:28,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:28,975 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:28,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:28,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:29,190 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:25:29,190 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:29,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:29,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:29,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:29,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:29,191 INFO L87 Difference]: Start difference. First operand 1555 states and 1787 transitions. Second operand 4 states. [2018-01-30 02:25:29,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:29,390 INFO L93 Difference]: Finished difference Result 3076 states and 3549 transitions. [2018-01-30 02:25:29,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:29,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2018-01-30 02:25:29,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:29,391 INFO L225 Difference]: With dead ends: 3076 [2018-01-30 02:25:29,391 INFO L226 Difference]: Without dead ends: 1645 [2018-01-30 02:25:29,393 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:25:29,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2018-01-30 02:25:29,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1555. [2018-01-30 02:25:29,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:25:29,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1786 transitions. [2018-01-30 02:25:29,413 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1786 transitions. Word has length 312 [2018-01-30 02:25:29,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:29,414 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1786 transitions. [2018-01-30 02:25:29,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:29,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1786 transitions. [2018-01-30 02:25:29,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-01-30 02:25:29,415 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:29,415 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] [2018-01-30 02:25:29,415 INFO L371 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:29,415 INFO L82 PathProgramCache]: Analyzing trace with hash 989745265, now seen corresponding path program 1 times [2018-01-30 02:25:29,415 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:29,416 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:29,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:29,416 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:29,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:29,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:29,670 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:25:29,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:29,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:29,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:29,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:29,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:29,671 INFO L87 Difference]: Start difference. First operand 1555 states and 1786 transitions. Second operand 4 states. [2018-01-30 02:25:29,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:29,897 INFO L93 Difference]: Finished difference Result 3429 states and 3949 transitions. [2018-01-30 02:25:29,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:29,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2018-01-30 02:25:29,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:29,899 INFO L225 Difference]: With dead ends: 3429 [2018-01-30 02:25:29,899 INFO L226 Difference]: Without dead ends: 1998 [2018-01-30 02:25:29,900 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:25:29,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2018-01-30 02:25:29,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1555. [2018-01-30 02:25:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:25:29,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1784 transitions. [2018-01-30 02:25:29,921 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1784 transitions. Word has length 314 [2018-01-30 02:25:29,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:29,921 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1784 transitions. [2018-01-30 02:25:29,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:29,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1784 transitions. [2018-01-30 02:25:29,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-01-30 02:25:29,923 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:29,923 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] [2018-01-30 02:25:29,923 INFO L371 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:29,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1388548973, now seen corresponding path program 1 times [2018-01-30 02:25:29,923 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:29,923 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:29,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:29,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:29,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:29,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:30,264 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:25:30,264 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:30,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:30,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:30,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:30,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:30,265 INFO L87 Difference]: Start difference. First operand 1555 states and 1784 transitions. Second operand 4 states. [2018-01-30 02:25:30,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:30,446 INFO L93 Difference]: Finished difference Result 3075 states and 3542 transitions. [2018-01-30 02:25:30,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:30,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2018-01-30 02:25:30,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:30,448 INFO L225 Difference]: With dead ends: 3075 [2018-01-30 02:25:30,448 INFO L226 Difference]: Without dead ends: 1644 [2018-01-30 02:25:30,449 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:25:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2018-01-30 02:25:30,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1555. [2018-01-30 02:25:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:25:30,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1783 transitions. [2018-01-30 02:25:30,471 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1783 transitions. Word has length 314 [2018-01-30 02:25:30,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:30,471 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1783 transitions. [2018-01-30 02:25:30,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:30,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1783 transitions. [2018-01-30 02:25:30,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-01-30 02:25:30,472 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:30,473 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] [2018-01-30 02:25:30,473 INFO L371 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:30,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1406634574, now seen corresponding path program 1 times [2018-01-30 02:25:30,473 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:30,473 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:30,473 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:30,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:30,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:30,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:30,836 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:25:30,836 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:30,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:30,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:30,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:30,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:30,837 INFO L87 Difference]: Start difference. First operand 1555 states and 1783 transitions. Second operand 4 states. [2018-01-30 02:25:31,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:31,053 INFO L93 Difference]: Finished difference Result 3383 states and 3893 transitions. [2018-01-30 02:25:31,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:31,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 317 [2018-01-30 02:25:31,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:31,054 INFO L225 Difference]: With dead ends: 3383 [2018-01-30 02:25:31,054 INFO L226 Difference]: Without dead ends: 1952 [2018-01-30 02:25:31,056 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:25:31,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2018-01-30 02:25:31,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1555. [2018-01-30 02:25:31,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:25:31,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1781 transitions. [2018-01-30 02:25:31,077 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1781 transitions. Word has length 317 [2018-01-30 02:25:31,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:31,078 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1781 transitions. [2018-01-30 02:25:31,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:31,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1781 transitions. [2018-01-30 02:25:31,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-01-30 02:25:31,079 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:31,079 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] [2018-01-30 02:25:31,079 INFO L371 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:31,079 INFO L82 PathProgramCache]: Analyzing trace with hash 583741231, now seen corresponding path program 1 times [2018-01-30 02:25:31,079 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:31,080 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:31,080 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:31,080 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:31,080 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:31,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:31,203 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:25:31,203 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:31,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:31,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:31,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:31,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:31,204 INFO L87 Difference]: Start difference. First operand 1555 states and 1781 transitions. Second operand 4 states. [2018-01-30 02:25:31,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:31,432 INFO L93 Difference]: Finished difference Result 3381 states and 3887 transitions. [2018-01-30 02:25:31,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:31,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 317 [2018-01-30 02:25:31,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:31,433 INFO L225 Difference]: With dead ends: 3381 [2018-01-30 02:25:31,433 INFO L226 Difference]: Without dead ends: 1950 [2018-01-30 02:25:31,434 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:25:31,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2018-01-30 02:25:31,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1561. [2018-01-30 02:25:31,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2018-01-30 02:25:31,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1787 transitions. [2018-01-30 02:25:31,457 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1787 transitions. Word has length 317 [2018-01-30 02:25:31,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:31,457 INFO L432 AbstractCegarLoop]: Abstraction has 1561 states and 1787 transitions. [2018-01-30 02:25:31,457 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:31,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1787 transitions. [2018-01-30 02:25:31,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-01-30 02:25:31,458 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:31,459 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] [2018-01-30 02:25:31,459 INFO L371 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:31,459 INFO L82 PathProgramCache]: Analyzing trace with hash -2006608430, now seen corresponding path program 1 times [2018-01-30 02:25:31,459 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:31,459 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:31,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:31,459 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:31,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:31,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:31,655 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:25:31,655 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:31,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:31,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:31,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:31,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:31,656 INFO L87 Difference]: Start difference. First operand 1561 states and 1787 transitions. Second operand 4 states. [2018-01-30 02:25:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:31,817 INFO L93 Difference]: Finished difference Result 3064 states and 3523 transitions. [2018-01-30 02:25:31,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:31,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 317 [2018-01-30 02:25:31,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:31,819 INFO L225 Difference]: With dead ends: 3064 [2018-01-30 02:25:31,819 INFO L226 Difference]: Without dead ends: 1627 [2018-01-30 02:25:31,820 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:25:31,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2018-01-30 02:25:31,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1561. [2018-01-30 02:25:31,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2018-01-30 02:25:31,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1786 transitions. [2018-01-30 02:25:31,841 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1786 transitions. Word has length 317 [2018-01-30 02:25:31,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:31,841 INFO L432 AbstractCegarLoop]: Abstraction has 1561 states and 1786 transitions. [2018-01-30 02:25:31,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:31,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1786 transitions. [2018-01-30 02:25:31,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-01-30 02:25:31,843 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:31,843 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] [2018-01-30 02:25:31,843 INFO L371 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:31,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1465465523, now seen corresponding path program 1 times [2018-01-30 02:25:31,843 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:31,843 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:31,844 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:31,844 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:31,844 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:31,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:25:31,979 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:25:31,979 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:31,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:31,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:31,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:31,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:31,980 INFO L87 Difference]: Start difference. First operand 1561 states and 1786 transitions. Second operand 4 states. [2018-01-30 02:25:32,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:32,141 INFO L93 Difference]: Finished difference Result 3063 states and 3520 transitions. [2018-01-30 02:25:32,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:32,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 317 [2018-01-30 02:25:32,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:32,142 INFO L225 Difference]: With dead ends: 3063 [2018-01-30 02:25:32,142 INFO L226 Difference]: Without dead ends: 1626 [2018-01-30 02:25:32,144 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:25:32,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2018-01-30 02:25:32,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1564. [2018-01-30 02:25:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2018-01-30 02:25:32,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 1789 transitions. [2018-01-30 02:25:32,165 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 1789 transitions. Word has length 317 [2018-01-30 02:25:32,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:32,165 INFO L432 AbstractCegarLoop]: Abstraction has 1564 states and 1789 transitions. [2018-01-30 02:25:32,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1789 transitions. [2018-01-30 02:25:32,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-01-30 02:25:32,166 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:32,167 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] [2018-01-30 02:25:32,167 INFO L371 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:32,167 INFO L82 PathProgramCache]: Analyzing trace with hash 421074356, now seen corresponding path program 1 times [2018-01-30 02:25:32,167 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:32,167 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:32,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:32,167 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:32,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:32,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:32,475 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:25:32,475 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:32,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:32,475 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:32,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:32,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:32,475 INFO L87 Difference]: Start difference. First operand 1564 states and 1789 transitions. Second operand 6 states. [2018-01-30 02:25:33,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:33,165 INFO L93 Difference]: Finished difference Result 4935 states and 5623 transitions. [2018-01-30 02:25:33,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:25:33,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 318 [2018-01-30 02:25:33,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:33,167 INFO L225 Difference]: With dead ends: 4935 [2018-01-30 02:25:33,167 INFO L226 Difference]: Without dead ends: 3495 [2018-01-30 02:25:33,169 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:25:33,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2018-01-30 02:25:33,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 1564. [2018-01-30 02:25:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2018-01-30 02:25:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 1787 transitions. [2018-01-30 02:25:33,197 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 1787 transitions. Word has length 318 [2018-01-30 02:25:33,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:33,197 INFO L432 AbstractCegarLoop]: Abstraction has 1564 states and 1787 transitions. [2018-01-30 02:25:33,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:33,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1787 transitions. [2018-01-30 02:25:33,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-01-30 02:25:33,199 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:33,199 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] [2018-01-30 02:25:33,199 INFO L371 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:33,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1984723632, now seen corresponding path program 1 times [2018-01-30 02:25:33,199 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:33,199 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:33,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:33,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:33,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:33,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:33,414 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:25:33,415 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:33,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:33,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:33,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:33,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:33,415 INFO L87 Difference]: Start difference. First operand 1564 states and 1787 transitions. Second operand 6 states. [2018-01-30 02:25:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:33,819 INFO L93 Difference]: Finished difference Result 4465 states and 5115 transitions. [2018-01-30 02:25:33,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:25:33,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 318 [2018-01-30 02:25:33,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:33,821 INFO L225 Difference]: With dead ends: 4465 [2018-01-30 02:25:33,822 INFO L226 Difference]: Without dead ends: 3025 [2018-01-30 02:25:33,823 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:25:33,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3025 states. [2018-01-30 02:25:33,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3025 to 1564. [2018-01-30 02:25:33,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2018-01-30 02:25:33,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 1786 transitions. [2018-01-30 02:25:33,851 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 1786 transitions. Word has length 318 [2018-01-30 02:25:33,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:33,851 INFO L432 AbstractCegarLoop]: Abstraction has 1564 states and 1786 transitions. [2018-01-30 02:25:33,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:33,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1786 transitions. [2018-01-30 02:25:33,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-01-30 02:25:33,853 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:33,853 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] [2018-01-30 02:25:33,853 INFO L371 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:33,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1929710554, now seen corresponding path program 1 times [2018-01-30 02:25:33,853 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:33,853 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:33,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:33,854 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:33,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:33,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:34,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:25:34,026 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:34,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:34,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:34,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:34,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:34,026 INFO L87 Difference]: Start difference. First operand 1564 states and 1786 transitions. Second operand 6 states. [2018-01-30 02:25:34,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:34,643 INFO L93 Difference]: Finished difference Result 4931 states and 5613 transitions. [2018-01-30 02:25:34,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:25:34,643 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 319 [2018-01-30 02:25:34,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:34,645 INFO L225 Difference]: With dead ends: 4931 [2018-01-30 02:25:34,645 INFO L226 Difference]: Without dead ends: 3491 [2018-01-30 02:25:34,647 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:25:34,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3491 states. [2018-01-30 02:25:34,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3491 to 1564. [2018-01-30 02:25:34,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2018-01-30 02:25:34,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 1784 transitions. [2018-01-30 02:25:34,678 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 1784 transitions. Word has length 319 [2018-01-30 02:25:34,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:34,678 INFO L432 AbstractCegarLoop]: Abstraction has 1564 states and 1784 transitions. [2018-01-30 02:25:34,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:34,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1784 transitions. [2018-01-30 02:25:34,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-01-30 02:25:34,680 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:34,680 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] [2018-01-30 02:25:34,680 INFO L371 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:34,680 INFO L82 PathProgramCache]: Analyzing trace with hash -701223254, now seen corresponding path program 1 times [2018-01-30 02:25:34,680 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:34,680 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:34,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:34,681 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:34,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:34,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:34,895 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:25:34,895 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:34,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:34,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:34,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:34,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:34,896 INFO L87 Difference]: Start difference. First operand 1564 states and 1784 transitions. Second operand 6 states. [2018-01-30 02:25:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:35,402 INFO L93 Difference]: Finished difference Result 4463 states and 5107 transitions. [2018-01-30 02:25:35,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:25:35,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 319 [2018-01-30 02:25:35,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:35,404 INFO L225 Difference]: With dead ends: 4463 [2018-01-30 02:25:35,404 INFO L226 Difference]: Without dead ends: 3023 [2018-01-30 02:25:35,406 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:25:35,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3023 states. [2018-01-30 02:25:35,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3023 to 1564. [2018-01-30 02:25:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2018-01-30 02:25:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 1783 transitions. [2018-01-30 02:25:35,436 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 1783 transitions. Word has length 319 [2018-01-30 02:25:35,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:35,436 INFO L432 AbstractCegarLoop]: Abstraction has 1564 states and 1783 transitions. [2018-01-30 02:25:35,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:35,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1783 transitions. [2018-01-30 02:25:35,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-01-30 02:25:35,438 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:35,438 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-01-30 02:25:35,438 INFO L371 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:35,438 INFO L82 PathProgramCache]: Analyzing trace with hash -714132438, now seen corresponding path program 1 times [2018-01-30 02:25:35,438 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:35,439 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:35,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:35,439 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:35,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:35,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:35,561 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:25:35,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:35,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:35,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:35,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:35,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:35,561 INFO L87 Difference]: Start difference. First operand 1564 states and 1783 transitions. Second operand 4 states. [2018-01-30 02:25:35,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:35,879 INFO L93 Difference]: Finished difference Result 3391 states and 3881 transitions. [2018-01-30 02:25:35,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:35,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2018-01-30 02:25:35,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:35,881 INFO L225 Difference]: With dead ends: 3391 [2018-01-30 02:25:35,881 INFO L226 Difference]: Without dead ends: 1951 [2018-01-30 02:25:35,882 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:25:35,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2018-01-30 02:25:35,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1570. [2018-01-30 02:25:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2018-01-30 02:25:35,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 1789 transitions. [2018-01-30 02:25:35,912 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 1789 transitions. Word has length 320 [2018-01-30 02:25:35,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:35,912 INFO L432 AbstractCegarLoop]: Abstraction has 1570 states and 1789 transitions. [2018-01-30 02:25:35,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:35,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 1789 transitions. [2018-01-30 02:25:35,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-01-30 02:25:35,914 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:35,914 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] [2018-01-30 02:25:35,914 INFO L371 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:35,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1285731802, now seen corresponding path program 1 times [2018-01-30 02:25:35,914 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:35,914 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:35,915 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:35,915 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:35,915 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:35,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:36,090 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:25:36,090 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:36,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:36,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:36,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:36,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:36,090 INFO L87 Difference]: Start difference. First operand 1570 states and 1789 transitions. Second operand 4 states. [2018-01-30 02:25:36,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:36,258 INFO L93 Difference]: Finished difference Result 3077 states and 3521 transitions. [2018-01-30 02:25:36,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:36,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2018-01-30 02:25:36,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:36,259 INFO L225 Difference]: With dead ends: 3077 [2018-01-30 02:25:36,259 INFO L226 Difference]: Without dead ends: 1631 [2018-01-30 02:25:36,260 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:25:36,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2018-01-30 02:25:36,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1573. [2018-01-30 02:25:36,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2018-01-30 02:25:36,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1792 transitions. [2018-01-30 02:25:36,287 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1792 transitions. Word has length 320 [2018-01-30 02:25:36,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:36,287 INFO L432 AbstractCegarLoop]: Abstraction has 1573 states and 1792 transitions. [2018-01-30 02:25:36,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:36,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1792 transitions. [2018-01-30 02:25:36,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-01-30 02:25:36,288 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:36,288 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] [2018-01-30 02:25:36,289 INFO L371 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:36,289 INFO L82 PathProgramCache]: Analyzing trace with hash -192779464, now seen corresponding path program 1 times [2018-01-30 02:25:36,289 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:36,289 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:36,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:36,289 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:36,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:36,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:36,788 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:25:36,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:36,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:36,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:36,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:36,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:36,789 INFO L87 Difference]: Start difference. First operand 1573 states and 1792 transitions. Second operand 6 states. [2018-01-30 02:25:37,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:37,601 INFO L93 Difference]: Finished difference Result 4945 states and 5618 transitions. [2018-01-30 02:25:37,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:25:37,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 321 [2018-01-30 02:25:37,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:37,602 INFO L225 Difference]: With dead ends: 4945 [2018-01-30 02:25:37,603 INFO L226 Difference]: Without dead ends: 3496 [2018-01-30 02:25:37,604 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:25:37,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3496 states. [2018-01-30 02:25:37,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3496 to 1573. [2018-01-30 02:25:37,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2018-01-30 02:25:37,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1790 transitions. [2018-01-30 02:25:37,636 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1790 transitions. Word has length 321 [2018-01-30 02:25:37,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:37,637 INFO L432 AbstractCegarLoop]: Abstraction has 1573 states and 1790 transitions. [2018-01-30 02:25:37,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:37,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1790 transitions. [2018-01-30 02:25:37,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-01-30 02:25:37,638 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:37,638 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] [2018-01-30 02:25:37,638 INFO L371 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:37,638 INFO L82 PathProgramCache]: Analyzing trace with hash -732490564, now seen corresponding path program 1 times [2018-01-30 02:25:37,638 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:37,639 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:37,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:37,639 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:37,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:37,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:37,804 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:25:37,804 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:37,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:37,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:37,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:37,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:37,805 INFO L87 Difference]: Start difference. First operand 1573 states and 1790 transitions. Second operand 6 states. [2018-01-30 02:25:38,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:38,329 INFO L93 Difference]: Finished difference Result 4479 states and 5114 transitions. [2018-01-30 02:25:38,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:25:38,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 321 [2018-01-30 02:25:38,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:38,331 INFO L225 Difference]: With dead ends: 4479 [2018-01-30 02:25:38,331 INFO L226 Difference]: Without dead ends: 3030 [2018-01-30 02:25:38,333 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:25:38,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2018-01-30 02:25:38,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 1573. [2018-01-30 02:25:38,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2018-01-30 02:25:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1789 transitions. [2018-01-30 02:25:38,366 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1789 transitions. Word has length 321 [2018-01-30 02:25:38,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:38,366 INFO L432 AbstractCegarLoop]: Abstraction has 1573 states and 1789 transitions. [2018-01-30 02:25:38,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:38,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1789 transitions. [2018-01-30 02:25:38,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-01-30 02:25:38,368 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:38,368 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] [2018-01-30 02:25:38,368 INFO L371 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:38,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1636122355, now seen corresponding path program 1 times [2018-01-30 02:25:38,368 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:38,368 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:38,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:38,369 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:38,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:38,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:38,549 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:25:38,549 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:38,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:38,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:38,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:38,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:38,549 INFO L87 Difference]: Start difference. First operand 1573 states and 1789 transitions. Second operand 6 states. [2018-01-30 02:25:39,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:39,097 INFO L93 Difference]: Finished difference Result 4943 states and 5610 transitions. [2018-01-30 02:25:39,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:25:39,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 322 [2018-01-30 02:25:39,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:39,099 INFO L225 Difference]: With dead ends: 4943 [2018-01-30 02:25:39,099 INFO L226 Difference]: Without dead ends: 3494 [2018-01-30 02:25:39,101 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:25:39,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2018-01-30 02:25:39,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 1573. [2018-01-30 02:25:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2018-01-30 02:25:39,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1787 transitions. [2018-01-30 02:25:39,136 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1787 transitions. Word has length 322 [2018-01-30 02:25:39,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:39,136 INFO L432 AbstractCegarLoop]: Abstraction has 1573 states and 1787 transitions. [2018-01-30 02:25:39,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:39,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1787 transitions. [2018-01-30 02:25:39,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-01-30 02:25:39,138 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:39,138 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] [2018-01-30 02:25:39,138 INFO L371 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:39,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1187297271, now seen corresponding path program 1 times [2018-01-30 02:25:39,138 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:39,138 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:39,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:39,139 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:39,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:39,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:39,298 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:25:39,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:39,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:39,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:39,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:39,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:39,299 INFO L87 Difference]: Start difference. First operand 1573 states and 1787 transitions. Second operand 6 states. [2018-01-30 02:25:39,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:39,696 INFO L93 Difference]: Finished difference Result 4478 states and 5107 transitions. [2018-01-30 02:25:39,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:25:39,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 322 [2018-01-30 02:25:39,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:39,698 INFO L225 Difference]: With dead ends: 4478 [2018-01-30 02:25:39,698 INFO L226 Difference]: Without dead ends: 3029 [2018-01-30 02:25:39,700 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:25:39,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3029 states. [2018-01-30 02:25:39,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3029 to 1573. [2018-01-30 02:25:39,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2018-01-30 02:25:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1786 transitions. [2018-01-30 02:25:39,737 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1786 transitions. Word has length 322 [2018-01-30 02:25:39,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:39,737 INFO L432 AbstractCegarLoop]: Abstraction has 1573 states and 1786 transitions. [2018-01-30 02:25:39,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:39,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1786 transitions. [2018-01-30 02:25:39,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-01-30 02:25:39,738 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:39,739 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] [2018-01-30 02:25:39,739 INFO L371 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:39,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1715530567, now seen corresponding path program 1 times [2018-01-30 02:25:39,739 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:39,739 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:39,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:39,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:39,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:39,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:39,890 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:25:39,890 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:39,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:39,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:39,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:39,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:39,891 INFO L87 Difference]: Start difference. First operand 1573 states and 1786 transitions. Second operand 4 states. [2018-01-30 02:25:40,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:40,176 INFO L93 Difference]: Finished difference Result 3384 states and 3859 transitions. [2018-01-30 02:25:40,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:40,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 323 [2018-01-30 02:25:40,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:40,178 INFO L225 Difference]: With dead ends: 3384 [2018-01-30 02:25:40,178 INFO L226 Difference]: Without dead ends: 1935 [2018-01-30 02:25:40,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:25:40,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2018-01-30 02:25:40,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1579. [2018-01-30 02:25:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2018-01-30 02:25:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 1792 transitions. [2018-01-30 02:25:40,213 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 1792 transitions. Word has length 323 [2018-01-30 02:25:40,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:40,213 INFO L432 AbstractCegarLoop]: Abstraction has 1579 states and 1792 transitions. [2018-01-30 02:25:40,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:40,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 1792 transitions. [2018-01-30 02:25:40,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-01-30 02:25:40,215 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:40,215 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] [2018-01-30 02:25:40,215 INFO L371 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:40,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1550761013, now seen corresponding path program 1 times [2018-01-30 02:25:40,215 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:40,215 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:40,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:40,216 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:40,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:40,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:40,385 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:25:40,385 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:40,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:40,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:40,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:40,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:40,385 INFO L87 Difference]: Start difference. First operand 1579 states and 1792 transitions. Second operand 4 states. [2018-01-30 02:25:40,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:40,577 INFO L93 Difference]: Finished difference Result 3079 states and 3509 transitions. [2018-01-30 02:25:40,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:40,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 323 [2018-01-30 02:25:40,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:40,578 INFO L225 Difference]: With dead ends: 3079 [2018-01-30 02:25:40,578 INFO L226 Difference]: Without dead ends: 1624 [2018-01-30 02:25:40,579 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:25:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2018-01-30 02:25:40,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1582. [2018-01-30 02:25:40,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:25:40,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1795 transitions. [2018-01-30 02:25:40,613 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1795 transitions. Word has length 323 [2018-01-30 02:25:40,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:40,613 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1795 transitions. [2018-01-30 02:25:40,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:40,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1795 transitions. [2018-01-30 02:25:40,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-01-30 02:25:40,614 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:40,614 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] [2018-01-30 02:25:40,614 INFO L371 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:40,614 INFO L82 PathProgramCache]: Analyzing trace with hash 823249463, now seen corresponding path program 1 times [2018-01-30 02:25:40,615 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:40,615 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:40,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:40,615 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:40,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:40,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:40,789 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:25:40,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:40,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:40,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:40,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:40,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:40,790 INFO L87 Difference]: Start difference. First operand 1582 states and 1795 transitions. Second operand 6 states. [2018-01-30 02:25:41,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:41,446 INFO L93 Difference]: Finished difference Result 4940 states and 5597 transitions. [2018-01-30 02:25:41,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:25:41,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 324 [2018-01-30 02:25:41,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:41,448 INFO L225 Difference]: With dead ends: 4940 [2018-01-30 02:25:41,448 INFO L226 Difference]: Without dead ends: 3482 [2018-01-30 02:25:41,450 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:25:41,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3482 states. [2018-01-30 02:25:41,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3482 to 1582. [2018-01-30 02:25:41,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:25:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1793 transitions. [2018-01-30 02:25:41,488 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1793 transitions. Word has length 324 [2018-01-30 02:25:41,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:41,488 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1793 transitions. [2018-01-30 02:25:41,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1793 transitions. [2018-01-30 02:25:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-01-30 02:25:41,489 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:41,489 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] [2018-01-30 02:25:41,489 INFO L371 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:41,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1647541709, now seen corresponding path program 1 times [2018-01-30 02:25:41,490 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:41,490 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:41,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:41,490 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:41,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:41,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:41,637 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:25:41,637 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:41,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:41,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:41,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:41,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:41,637 INFO L87 Difference]: Start difference. First operand 1582 states and 1793 transitions. Second operand 6 states. [2018-01-30 02:25:42,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:42,145 INFO L93 Difference]: Finished difference Result 4482 states and 5101 transitions. [2018-01-30 02:25:42,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:25:42,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 324 [2018-01-30 02:25:42,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:42,147 INFO L225 Difference]: With dead ends: 4482 [2018-01-30 02:25:42,147 INFO L226 Difference]: Without dead ends: 3024 [2018-01-30 02:25:42,148 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:25:42,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3024 states. [2018-01-30 02:25:42,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3024 to 1582. [2018-01-30 02:25:42,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:25:42,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1792 transitions. [2018-01-30 02:25:42,189 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1792 transitions. Word has length 324 [2018-01-30 02:25:42,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:42,189 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1792 transitions. [2018-01-30 02:25:42,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:42,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1792 transitions. [2018-01-30 02:25:42,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-01-30 02:25:42,190 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:42,190 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] [2018-01-30 02:25:42,190 INFO L371 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:42,190 INFO L82 PathProgramCache]: Analyzing trace with hash -561117202, now seen corresponding path program 1 times [2018-01-30 02:25:42,190 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:42,190 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:42,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:42,191 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:42,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:42,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:42,391 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:25:42,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:42,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:42,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:42,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:42,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:42,392 INFO L87 Difference]: Start difference. First operand 1582 states and 1792 transitions. Second operand 6 states. [2018-01-30 02:25:42,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:42,947 INFO L93 Difference]: Finished difference Result 4924 states and 5575 transitions. [2018-01-30 02:25:42,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:25:42,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 325 [2018-01-30 02:25:42,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:42,950 INFO L225 Difference]: With dead ends: 4924 [2018-01-30 02:25:42,950 INFO L226 Difference]: Without dead ends: 3466 [2018-01-30 02:25: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:25:42,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3466 states. [2018-01-30 02:25:42,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3466 to 1582. [2018-01-30 02:25:42,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:25:42,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1790 transitions. [2018-01-30 02:25:42,994 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1790 transitions. Word has length 325 [2018-01-30 02:25:42,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:42,994 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1790 transitions. [2018-01-30 02:25:42,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:42,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1790 transitions. [2018-01-30 02:25:42,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-01-30 02:25:42,995 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:42,995 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] [2018-01-30 02:25:42,996 INFO L371 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:42,996 INFO L82 PathProgramCache]: Analyzing trace with hash 153767794, now seen corresponding path program 1 times [2018-01-30 02:25:42,996 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:42,996 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:42,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:42,996 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:42,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:43,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:43,153 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:25:43,153 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:43,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:43,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:43,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:43,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:43,154 INFO L87 Difference]: Start difference. First operand 1582 states and 1790 transitions. Second operand 6 states. [2018-01-30 02:25:43,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:43,554 INFO L93 Difference]: Finished difference Result 4474 states and 5087 transitions. [2018-01-30 02:25:43,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:25:43,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 325 [2018-01-30 02:25:43,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:43,556 INFO L225 Difference]: With dead ends: 4474 [2018-01-30 02:25:43,556 INFO L226 Difference]: Without dead ends: 3016 [2018-01-30 02:25:43,558 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:25:43,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2018-01-30 02:25:43,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 1582. [2018-01-30 02:25:43,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:25:43,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1789 transitions. [2018-01-30 02:25:43,601 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1789 transitions. Word has length 325 [2018-01-30 02:25:43,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:43,601 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1789 transitions. [2018-01-30 02:25:43,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:43,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1789 transitions. [2018-01-30 02:25:43,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-01-30 02:25:43,602 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:43,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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:25:43,602 INFO L371 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:43,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1933015856, now seen corresponding path program 1 times [2018-01-30 02:25:43,602 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:43,602 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:43,603 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:43,603 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:43,603 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:43,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:43,788 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:25:43,788 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:43,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:43,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:43,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:43,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:43,789 INFO L87 Difference]: Start difference. First operand 1582 states and 1789 transitions. Second operand 6 states. [2018-01-30 02:25:44,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:44,348 INFO L93 Difference]: Finished difference Result 4922 states and 5567 transitions. [2018-01-30 02:25:44,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:25:44,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 327 [2018-01-30 02:25:44,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:44,350 INFO L225 Difference]: With dead ends: 4922 [2018-01-30 02:25:44,350 INFO L226 Difference]: Without dead ends: 3464 [2018-01-30 02:25:44,352 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:25:44,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3464 states. [2018-01-30 02:25:44,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3464 to 1582. [2018-01-30 02:25:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:25:44,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1787 transitions. [2018-01-30 02:25:44,396 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1787 transitions. Word has length 327 [2018-01-30 02:25:44,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:44,397 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1787 transitions. [2018-01-30 02:25:44,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:44,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1787 transitions. [2018-01-30 02:25:44,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-01-30 02:25:44,398 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:44,398 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] [2018-01-30 02:25:44,398 INFO L371 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:44,398 INFO L82 PathProgramCache]: Analyzing trace with hash -2123302060, now seen corresponding path program 1 times [2018-01-30 02:25:44,398 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:44,398 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:44,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:44,399 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:44,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:44,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:44,551 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:25:44,552 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:44,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:44,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:44,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:44,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:44,552 INFO L87 Difference]: Start difference. First operand 1582 states and 1787 transitions. Second operand 6 states. [2018-01-30 02:25:45,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:45,095 INFO L93 Difference]: Finished difference Result 4473 states and 5080 transitions. [2018-01-30 02:25:45,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:25:45,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 327 [2018-01-30 02:25:45,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:45,097 INFO L225 Difference]: With dead ends: 4473 [2018-01-30 02:25:45,097 INFO L226 Difference]: Without dead ends: 3015 [2018-01-30 02:25:45,098 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:25:45,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2018-01-30 02:25:45,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 1582. [2018-01-30 02:25:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:25:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1786 transitions. [2018-01-30 02:25:45,141 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1786 transitions. Word has length 327 [2018-01-30 02:25:45,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:45,141 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1786 transitions. [2018-01-30 02:25:45,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:45,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1786 transitions. [2018-01-30 02:25:45,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-01-30 02:25:45,142 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:45,142 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] [2018-01-30 02:25:45,142 INFO L371 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:45,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1302070671, now seen corresponding path program 1 times [2018-01-30 02:25:45,142 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:45,142 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:45,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:45,143 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:45,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:45,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:25:45,296 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:25:45,296 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:45,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:45,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:45,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:45,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:45,297 INFO L87 Difference]: Start difference. First operand 1582 states and 1786 transitions. Second operand 6 states. [2018-01-30 02:25:45,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:45,848 INFO L93 Difference]: Finished difference Result 4876 states and 5511 transitions. [2018-01-30 02:25:45,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:25:45,849 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 330 [2018-01-30 02:25:45,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:45,851 INFO L225 Difference]: With dead ends: 4876 [2018-01-30 02:25:45,851 INFO L226 Difference]: Without dead ends: 3418 [2018-01-30 02:25:45,852 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:25:45,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3418 states. [2018-01-30 02:25:45,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3418 to 1582. [2018-01-30 02:25:45,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:25:45,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1784 transitions. [2018-01-30 02:25:45,899 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1784 transitions. Word has length 330 [2018-01-30 02:25:45,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:45,899 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1784 transitions. [2018-01-30 02:25:45,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:45,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1784 transitions. [2018-01-30 02:25:45,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-01-30 02:25:45,900 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:45,900 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] [2018-01-30 02:25:45,900 INFO L371 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:45,900 INFO L82 PathProgramCache]: Analyzing trace with hash 479177328, now seen corresponding path program 1 times [2018-01-30 02:25:45,901 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:45,901 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:45,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:45,901 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:45,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:45,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:46,063 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:25:46,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:46,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:46,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:46,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:46,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:46,064 INFO L87 Difference]: Start difference. First operand 1582 states and 1784 transitions. Second operand 6 states. [2018-01-30 02:25:46,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:46,666 INFO L93 Difference]: Finished difference Result 4874 states and 5505 transitions. [2018-01-30 02:25:46,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:25:46,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 330 [2018-01-30 02:25:46,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:46,668 INFO L225 Difference]: With dead ends: 4874 [2018-01-30 02:25:46,668 INFO L226 Difference]: Without dead ends: 3416 [2018-01-30 02:25:46,669 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:25:46,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2018-01-30 02:25:46,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 1582. [2018-01-30 02:25:46,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:25:46,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1782 transitions. [2018-01-30 02:25:46,718 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1782 transitions. Word has length 330 [2018-01-30 02:25:46,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:46,718 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1782 transitions. [2018-01-30 02:25:46,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:46,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1782 transitions. [2018-01-30 02:25:46,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-01-30 02:25:46,719 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:46,719 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] [2018-01-30 02:25:46,719 INFO L371 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:46,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1842598027, now seen corresponding path program 1 times [2018-01-30 02:25:46,719 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:46,719 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:46,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:46,720 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:46,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:46,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:46,872 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:25:46,872 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:46,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:46,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:46,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:46,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:46,873 INFO L87 Difference]: Start difference. First operand 1582 states and 1782 transitions. Second operand 6 states. [2018-01-30 02:25:47,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:47,451 INFO L93 Difference]: Finished difference Result 4450 states and 5045 transitions. [2018-01-30 02:25:47,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:25:47,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 330 [2018-01-30 02:25:47,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:47,453 INFO L225 Difference]: With dead ends: 4450 [2018-01-30 02:25:47,453 INFO L226 Difference]: Without dead ends: 2992 [2018-01-30 02:25:47,454 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:25:47,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2018-01-30 02:25:47,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 1582. [2018-01-30 02:25:47,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:25:47,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1781 transitions. [2018-01-30 02:25:47,503 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1781 transitions. Word has length 330 [2018-01-30 02:25:47,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:47,503 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1781 transitions. [2018-01-30 02:25:47,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:47,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1781 transitions. [2018-01-30 02:25:47,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-01-30 02:25:47,504 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:47,505 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] [2018-01-30 02:25:47,505 INFO L371 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:47,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1019704684, now seen corresponding path program 1 times [2018-01-30 02:25:47,505 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:47,505 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:47,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:47,506 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:47,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:47,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:47,664 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:25:47,664 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:47,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:47,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:47,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:47,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:47,664 INFO L87 Difference]: Start difference. First operand 1582 states and 1781 transitions. Second operand 6 states. [2018-01-30 02:25:48,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:48,256 INFO L93 Difference]: Finished difference Result 4449 states and 5042 transitions. [2018-01-30 02:25:48,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:25:48,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 330 [2018-01-30 02:25:48,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:48,258 INFO L225 Difference]: With dead ends: 4449 [2018-01-30 02:25:48,258 INFO L226 Difference]: Without dead ends: 2991 [2018-01-30 02:25:48,259 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:25:48,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2018-01-30 02:25:48,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 1582. [2018-01-30 02:25:48,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:25:48,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1780 transitions. [2018-01-30 02:25:48,309 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1780 transitions. Word has length 330 [2018-01-30 02:25:48,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:48,309 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1780 transitions. [2018-01-30 02:25:48,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:48,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1780 transitions. [2018-01-30 02:25:48,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-01-30 02:25:48,310 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:48,311 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] [2018-01-30 02:25:48,311 INFO L371 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:48,311 INFO L82 PathProgramCache]: Analyzing trace with hash 907843694, now seen corresponding path program 1 times [2018-01-30 02:25:48,311 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:48,311 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:48,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:48,311 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:48,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:48,318 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:48,480 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:25:48,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:48,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:48,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:48,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:48,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:48,481 INFO L87 Difference]: Start difference. First operand 1582 states and 1780 transitions. Second operand 4 states. [2018-01-30 02:25:48,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:48,770 INFO L93 Difference]: Finished difference Result 3394 states and 3837 transitions. [2018-01-30 02:25:48,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:48,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2018-01-30 02:25:48,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:48,771 INFO L225 Difference]: With dead ends: 3394 [2018-01-30 02:25:48,771 INFO L226 Difference]: Without dead ends: 1936 [2018-01-30 02:25:48,772 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:25:48,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2018-01-30 02:25:48,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1600. [2018-01-30 02:25:48,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2018-01-30 02:25:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 1802 transitions. [2018-01-30 02:25:48,821 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 1802 transitions. Word has length 333 [2018-01-30 02:25:48,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:48,821 INFO L432 AbstractCegarLoop]: Abstraction has 1600 states and 1802 transitions. [2018-01-30 02:25:48,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 1802 transitions. [2018-01-30 02:25:48,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-01-30 02:25:48,822 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:48,822 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] [2018-01-30 02:25:48,822 INFO L371 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:48,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1926077111, now seen corresponding path program 1 times [2018-01-30 02:25:48,822 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:48,822 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:48,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:48,823 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:48,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:48,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:48,986 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:25:48,986 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:48,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:48,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:48,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:48,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:48,987 INFO L87 Difference]: Start difference. First operand 1600 states and 1802 transitions. Second operand 6 states. [2018-01-30 02:25:49,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:49,734 INFO L93 Difference]: Finished difference Result 4906 states and 5535 transitions. [2018-01-30 02:25:49,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:25:49,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 333 [2018-01-30 02:25:49,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:49,736 INFO L225 Difference]: With dead ends: 4906 [2018-01-30 02:25:49,736 INFO L226 Difference]: Without dead ends: 3430 [2018-01-30 02:25:49,737 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:25:49,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3430 states. [2018-01-30 02:25:49,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3430 to 1600. [2018-01-30 02:25:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2018-01-30 02:25:49,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 1800 transitions. [2018-01-30 02:25:49,793 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 1800 transitions. Word has length 333 [2018-01-30 02:25:49,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:49,793 INFO L432 AbstractCegarLoop]: Abstraction has 1600 states and 1800 transitions. [2018-01-30 02:25:49,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:49,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 1800 transitions. [2018-01-30 02:25:49,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-01-30 02:25:49,794 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:49,794 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] [2018-01-30 02:25:49,794 INFO L371 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:49,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1925913586, now seen corresponding path program 1 times [2018-01-30 02:25:49,795 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:49,795 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:49,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:49,795 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:49,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:49,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:49,903 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-01-30 02:25:49,903 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:49,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:25:49,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:25:49,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:25:49,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:25:49,904 INFO L87 Difference]: Start difference. First operand 1600 states and 1800 transitions. Second operand 3 states. [2018-01-30 02:25:50,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:50,087 INFO L93 Difference]: Finished difference Result 3869 states and 4375 transitions. [2018-01-30 02:25:50,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:25:50,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2018-01-30 02:25:50,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:50,089 INFO L225 Difference]: With dead ends: 3869 [2018-01-30 02:25:50,089 INFO L226 Difference]: Without dead ends: 2393 [2018-01-30 02:25:50,090 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:25:50,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2018-01-30 02:25:50,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2393. [2018-01-30 02:25:50,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2393 states. [2018-01-30 02:25:50,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 2696 transitions. [2018-01-30 02:25:50,166 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 2696 transitions. Word has length 333 [2018-01-30 02:25:50,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:50,166 INFO L432 AbstractCegarLoop]: Abstraction has 2393 states and 2696 transitions. [2018-01-30 02:25:50,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:25:50,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 2696 transitions. [2018-01-30 02:25:50,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-01-30 02:25:50,167 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:50,168 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] [2018-01-30 02:25:50,168 INFO L371 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:50,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2127980397, now seen corresponding path program 1 times [2018-01-30 02:25:50,168 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:50,168 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:50,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:50,169 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:50,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:50,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:50,279 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:25:50,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:50,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:25:50,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:25:50,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:25:50,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:25:50,280 INFO L87 Difference]: Start difference. First operand 2393 states and 2696 transitions. Second operand 3 states. [2018-01-30 02:25:50,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:50,759 INFO L93 Difference]: Finished difference Result 5457 states and 6168 transitions. [2018-01-30 02:25:50,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:25:50,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 338 [2018-01-30 02:25:50,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:50,761 INFO L225 Difference]: With dead ends: 5457 [2018-01-30 02:25:50,761 INFO L226 Difference]: Without dead ends: 3188 [2018-01-30 02:25:50,762 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:25:50,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3188 states. [2018-01-30 02:25:50,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3188 to 3186. [2018-01-30 02:25:50,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3186 states. [2018-01-30 02:25:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 3596 transitions. [2018-01-30 02:25:50,864 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 3596 transitions. Word has length 338 [2018-01-30 02:25:50,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:50,864 INFO L432 AbstractCegarLoop]: Abstraction has 3186 states and 3596 transitions. [2018-01-30 02:25:50,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:25:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 3596 transitions. [2018-01-30 02:25:50,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-01-30 02:25:50,865 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:50,866 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, 1, 1, 1, 1] [2018-01-30 02:25:50,866 INFO L371 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:50,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1335514758, now seen corresponding path program 1 times [2018-01-30 02:25:50,866 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:50,866 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:50,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:50,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:50,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:50,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:25:50,953 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:25:50,953 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:50,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:25:50,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:25:50,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:25:50,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:25:50,954 INFO L87 Difference]: Start difference. First operand 3186 states and 3596 transitions. Second operand 3 states. [2018-01-30 02:25:51,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:51,093 INFO L93 Difference]: Finished difference Result 7043 states and 7966 transitions. [2018-01-30 02:25:51,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:25:51,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 353 [2018-01-30 02:25:51,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:51,095 INFO L225 Difference]: With dead ends: 7043 [2018-01-30 02:25:51,095 INFO L226 Difference]: Without dead ends: 3981 [2018-01-30 02:25:51,098 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:25:51,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2018-01-30 02:25:51,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3979. [2018-01-30 02:25:51,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3979 states. [2018-01-30 02:25:51,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3979 states to 3979 states and 4482 transitions. [2018-01-30 02:25:51,226 INFO L78 Accepts]: Start accepts. Automaton has 3979 states and 4482 transitions. Word has length 353 [2018-01-30 02:25:51,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:51,227 INFO L432 AbstractCegarLoop]: Abstraction has 3979 states and 4482 transitions. [2018-01-30 02:25:51,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:25:51,227 INFO L276 IsEmpty]: Start isEmpty. Operand 3979 states and 4482 transitions. [2018-01-30 02:25:51,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-01-30 02:25:51,229 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:51,229 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:51,229 INFO L371 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:51,229 INFO L82 PathProgramCache]: Analyzing trace with hash 213919486, now seen corresponding path program 1 times [2018-01-30 02:25:51,229 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:51,229 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:51,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:51,230 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:51,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:51,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:25:51,409 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-01-30 02:25:51,409 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:51,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:25:51,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:25:51,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:25:51,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:25:51,409 INFO L87 Difference]: Start difference. First operand 3979 states and 4482 transitions. Second operand 3 states. [2018-01-30 02:25:51,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:51,757 INFO L93 Difference]: Finished difference Result 8627 states and 9737 transitions. [2018-01-30 02:25:51,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:25:51,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 406 [2018-01-30 02:25:51,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:51,759 INFO L225 Difference]: With dead ends: 8627 [2018-01-30 02:25:51,760 INFO L226 Difference]: Without dead ends: 4772 [2018-01-30 02:25:51,763 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:25:51,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4772 states. [2018-01-30 02:25:51,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4772 to 4772. [2018-01-30 02:25:51,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4772 states. [2018-01-30 02:25:51,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4772 states to 4772 states and 5379 transitions. [2018-01-30 02:25:51,916 INFO L78 Accepts]: Start accepts. Automaton has 4772 states and 5379 transitions. Word has length 406 [2018-01-30 02:25:51,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:51,916 INFO L432 AbstractCegarLoop]: Abstraction has 4772 states and 5379 transitions. [2018-01-30 02:25:51,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:25:51,916 INFO L276 IsEmpty]: Start isEmpty. Operand 4772 states and 5379 transitions. [2018-01-30 02:25:51,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-01-30 02:25:51,919 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:51,919 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, 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] [2018-01-30 02:25:51,919 INFO L371 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:51,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1643759968, now seen corresponding path program 1 times [2018-01-30 02:25:51,919 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:51,919 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:51,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:51,920 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:51,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:51,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-01-30 02:25:52,056 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:52,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:25:52,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:25:52,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:25:52,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:25:52,056 INFO L87 Difference]: Start difference. First operand 4772 states and 5379 transitions. Second operand 3 states. [2018-01-30 02:25:52,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:52,256 INFO L93 Difference]: Finished difference Result 5569 states and 6276 transitions. [2018-01-30 02:25:52,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:25:52,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 423 [2018-01-30 02:25:52,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:52,259 INFO L225 Difference]: With dead ends: 5569 [2018-01-30 02:25:52,259 INFO L226 Difference]: Without dead ends: 5567 [2018-01-30 02:25:52,260 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:25:52,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5567 states. [2018-01-30 02:25:52,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5567 to 5565. [2018-01-30 02:25:52,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5565 states. [2018-01-30 02:25:52,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5565 states to 5565 states and 6273 transitions. [2018-01-30 02:25:52,443 INFO L78 Accepts]: Start accepts. Automaton has 5565 states and 6273 transitions. Word has length 423 [2018-01-30 02:25:52,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:52,443 INFO L432 AbstractCegarLoop]: Abstraction has 5565 states and 6273 transitions. [2018-01-30 02:25:52,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:25:52,443 INFO L276 IsEmpty]: Start isEmpty. Operand 5565 states and 6273 transitions. [2018-01-30 02:25:52,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2018-01-30 02:25:52,446 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:52,446 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:25:52,446 INFO L371 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:52,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1194849080, now seen corresponding path program 1 times [2018-01-30 02:25:52,447 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:52,447 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:52,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:52,447 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:52,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:52,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:52,745 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-01-30 02:25:52,746 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:52,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:52,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:52,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:52,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:52,746 INFO L87 Difference]: Start difference. First operand 5565 states and 6273 transitions. Second operand 4 states. [2018-01-30 02:25:53,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:53,172 INFO L93 Difference]: Finished difference Result 12556 states and 14201 transitions. [2018-01-30 02:25:53,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:25:53,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 524 [2018-01-30 02:25:53,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:53,176 INFO L225 Difference]: With dead ends: 12556 [2018-01-30 02:25:53,176 INFO L226 Difference]: Without dead ends: 7115 [2018-01-30 02:25:53,180 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:25:53,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7115 states. [2018-01-30 02:25:53,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7115 to 6118. [2018-01-30 02:25:53,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6118 states. [2018-01-30 02:25:53,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6118 states to 6118 states and 6973 transitions. [2018-01-30 02:25:53,373 INFO L78 Accepts]: Start accepts. Automaton has 6118 states and 6973 transitions. Word has length 524 [2018-01-30 02:25:53,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:53,374 INFO L432 AbstractCegarLoop]: Abstraction has 6118 states and 6973 transitions. [2018-01-30 02:25:53,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:53,374 INFO L276 IsEmpty]: Start isEmpty. Operand 6118 states and 6973 transitions. [2018-01-30 02:25:53,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2018-01-30 02:25:53,377 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:53,377 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:25:53,377 INFO L371 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:53,378 INFO L82 PathProgramCache]: Analyzing trace with hash 672997210, now seen corresponding path program 1 times [2018-01-30 02:25:53,378 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:53,378 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:53,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:53,378 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:53,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:53,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:53,526 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-01-30 02:25:53,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:53,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:25:53,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:25:53,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:25:53,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:25:53,527 INFO L87 Difference]: Start difference. First operand 6118 states and 6973 transitions. Second operand 3 states. [2018-01-30 02:25:53,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:53,738 INFO L93 Difference]: Finished difference Result 8738 states and 9965 transitions. [2018-01-30 02:25:53,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:25:53,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 530 [2018-01-30 02:25:53,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:53,742 INFO L225 Difference]: With dead ends: 8738 [2018-01-30 02:25:53,742 INFO L226 Difference]: Without dead ends: 6990 [2018-01-30 02:25:53,744 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:25:53,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6990 states. [2018-01-30 02:25:53,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6990 to 6990. [2018-01-30 02:25:53,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6990 states. [2018-01-30 02:25:53,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6990 states to 6990 states and 7971 transitions. [2018-01-30 02:25:53,961 INFO L78 Accepts]: Start accepts. Automaton has 6990 states and 7971 transitions. Word has length 530 [2018-01-30 02:25:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:53,961 INFO L432 AbstractCegarLoop]: Abstraction has 6990 states and 7971 transitions. [2018-01-30 02:25:53,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:25:53,961 INFO L276 IsEmpty]: Start isEmpty. Operand 6990 states and 7971 transitions. [2018-01-30 02:25:53,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2018-01-30 02:25:53,965 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:53,965 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, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:53,965 INFO L371 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:53,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1137232207, now seen corresponding path program 1 times [2018-01-30 02:25:53,966 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:53,966 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:53,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:53,966 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:53,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:53,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-01-30 02:25:54,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:54,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:25:54,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:25:54,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:25:54,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:25:54,393 INFO L87 Difference]: Start difference. First operand 6990 states and 7971 transitions. Second operand 6 states. [2018-01-30 02:25:55,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:55,494 INFO L93 Difference]: Finished difference Result 22955 states and 26196 transitions. [2018-01-30 02:25:55,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:25:55,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 537 [2018-01-30 02:25:55,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:55,503 INFO L225 Difference]: With dead ends: 22955 [2018-01-30 02:25:55,504 INFO L226 Difference]: Without dead ends: 16089 [2018-01-30 02:25:55,510 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:25:55,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16089 states. [2018-01-30 02:25:55,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16089 to 7102. [2018-01-30 02:25:55,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7102 states. [2018-01-30 02:25:55,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7102 states to 7102 states and 8091 transitions. [2018-01-30 02:25:55,814 INFO L78 Accepts]: Start accepts. Automaton has 7102 states and 8091 transitions. Word has length 537 [2018-01-30 02:25:55,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:55,814 INFO L432 AbstractCegarLoop]: Abstraction has 7102 states and 8091 transitions. [2018-01-30 02:25:55,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:25:55,815 INFO L276 IsEmpty]: Start isEmpty. Operand 7102 states and 8091 transitions. [2018-01-30 02:25:55,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2018-01-30 02:25:55,818 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:55,818 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:55,819 INFO L371 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:55,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1009085174, now seen corresponding path program 1 times [2018-01-30 02:25:55,819 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:55,819 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:55,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:55,819 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:55,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:55,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:56,088 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 506 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-01-30 02:25:56,088 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:56,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:56,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:56,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:56,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:56,089 INFO L87 Difference]: Start difference. First operand 7102 states and 8091 transitions. Second operand 4 states. [2018-01-30 02:25:56,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:56,661 INFO L93 Difference]: Finished difference Result 16833 states and 19226 transitions. [2018-01-30 02:25:56,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:56,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 560 [2018-01-30 02:25:56,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:56,667 INFO L225 Difference]: With dead ends: 16833 [2018-01-30 02:25:56,667 INFO L226 Difference]: Without dead ends: 9855 [2018-01-30 02:25:56,673 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:25:56,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9855 states. [2018-01-30 02:25:56,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9855 to 7950. [2018-01-30 02:25:56,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7950 states. [2018-01-30 02:25:56,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7950 states to 7950 states and 9179 transitions. [2018-01-30 02:25:56,930 INFO L78 Accepts]: Start accepts. Automaton has 7950 states and 9179 transitions. Word has length 560 [2018-01-30 02:25:56,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:56,930 INFO L432 AbstractCegarLoop]: Abstraction has 7950 states and 9179 transitions. [2018-01-30 02:25:56,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:56,930 INFO L276 IsEmpty]: Start isEmpty. Operand 7950 states and 9179 transitions. [2018-01-30 02:25:56,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2018-01-30 02:25:56,934 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:56,934 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:56,934 INFO L371 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:56,934 INFO L82 PathProgramCache]: Analyzing trace with hash 802833956, now seen corresponding path program 1 times [2018-01-30 02:25:56,935 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:56,935 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:56,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:56,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:56,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:56,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:57,229 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-01-30 02:25:57,229 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:57,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:57,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:57,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:57,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:57,230 INFO L87 Difference]: Start difference. First operand 7950 states and 9179 transitions. Second operand 4 states. [2018-01-30 02:25:57,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:57,755 INFO L93 Difference]: Finished difference Result 17276 states and 19950 transitions. [2018-01-30 02:25:57,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:25:57,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 562 [2018-01-30 02:25:57,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:57,760 INFO L225 Difference]: With dead ends: 17276 [2018-01-30 02:25:57,760 INFO L226 Difference]: Without dead ends: 9450 [2018-01-30 02:25:57,766 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:25:57,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9450 states. [2018-01-30 02:25:58,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9450 to 7974. [2018-01-30 02:25:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7974 states. [2018-01-30 02:25:58,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7974 states to 7974 states and 9203 transitions. [2018-01-30 02:25:58,011 INFO L78 Accepts]: Start accepts. Automaton has 7974 states and 9203 transitions. Word has length 562 [2018-01-30 02:25:58,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:58,011 INFO L432 AbstractCegarLoop]: Abstraction has 7974 states and 9203 transitions. [2018-01-30 02:25:58,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:58,011 INFO L276 IsEmpty]: Start isEmpty. Operand 7974 states and 9203 transitions. [2018-01-30 02:25:58,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2018-01-30 02:25:58,015 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:58,015 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:58,016 INFO L371 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:58,016 INFO L82 PathProgramCache]: Analyzing trace with hash -865704345, now seen corresponding path program 1 times [2018-01-30 02:25:58,016 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:58,016 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:58,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:58,016 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:58,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:58,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:58,366 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2018-01-30 02:25:58,367 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:58,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:58,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:58,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:58,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:58,367 INFO L87 Difference]: Start difference. First operand 7974 states and 9203 transitions. Second operand 4 states. [2018-01-30 02:25:58,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:25:58,900 INFO L93 Difference]: Finished difference Result 17836 states and 20598 transitions. [2018-01-30 02:25:58,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:25:58,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 563 [2018-01-30 02:25:58,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:25:58,907 INFO L225 Difference]: With dead ends: 17836 [2018-01-30 02:25:58,907 INFO L226 Difference]: Without dead ends: 9986 [2018-01-30 02:25:58,912 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:25:58,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9986 states. [2018-01-30 02:25:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9986 to 8702. [2018-01-30 02:25:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8702 states. [2018-01-30 02:25:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8702 states to 8702 states and 10131 transitions. [2018-01-30 02:25:59,168 INFO L78 Accepts]: Start accepts. Automaton has 8702 states and 10131 transitions. Word has length 563 [2018-01-30 02:25:59,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:25:59,169 INFO L432 AbstractCegarLoop]: Abstraction has 8702 states and 10131 transitions. [2018-01-30 02:25:59,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:25:59,169 INFO L276 IsEmpty]: Start isEmpty. Operand 8702 states and 10131 transitions. [2018-01-30 02:25:59,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2018-01-30 02:25:59,173 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:25:59,173 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:59,173 INFO L371 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:25:59,174 INFO L82 PathProgramCache]: Analyzing trace with hash -422783541, now seen corresponding path program 1 times [2018-01-30 02:25:59,174 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:25:59,174 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:25:59,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:59,174 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:25:59,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:25:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:25:59,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:25:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 506 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-01-30 02:25:59,533 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:25:59,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:25:59,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:25:59,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:25:59,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:25:59,534 INFO L87 Difference]: Start difference. First operand 8702 states and 10131 transitions. Second operand 4 states. [2018-01-30 02:26:00,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:26:00,271 INFO L93 Difference]: Finished difference Result 19119 states and 22140 transitions. [2018-01-30 02:26:00,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:26:00,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 563 [2018-01-30 02:26:00,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:26:00,278 INFO L225 Difference]: With dead ends: 19119 [2018-01-30 02:26:00,278 INFO L226 Difference]: Without dead ends: 10541 [2018-01-30 02:26:00,283 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:26:00,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10541 states. [2018-01-30 02:26:00,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10541 to 8726. [2018-01-30 02:26:00,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8726 states. [2018-01-30 02:26:00,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8726 states to 8726 states and 10155 transitions. [2018-01-30 02:26:00,544 INFO L78 Accepts]: Start accepts. Automaton has 8726 states and 10155 transitions. Word has length 563 [2018-01-30 02:26:00,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:26:00,544 INFO L432 AbstractCegarLoop]: Abstraction has 8726 states and 10155 transitions. [2018-01-30 02:26:00,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:26:00,544 INFO L276 IsEmpty]: Start isEmpty. Operand 8726 states and 10155 transitions. [2018-01-30 02:26:00,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2018-01-30 02:26:00,549 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:26:00,549 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:00,549 INFO L371 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:26:00,549 INFO L82 PathProgramCache]: Analyzing trace with hash -41729923, now seen corresponding path program 1 times [2018-01-30 02:26:00,549 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:26:00,549 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:26:00,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:26:00,550 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:26:00,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:26:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:26:00,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:26:00,816 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-01-30 02:26:00,816 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:26:00,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:26:00,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:26:00,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:26:00,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:26:00,817 INFO L87 Difference]: Start difference. First operand 8726 states and 10155 transitions. Second operand 4 states. [2018-01-30 02:26:01,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:26:01,327 INFO L93 Difference]: Finished difference Result 18796 states and 21862 transitions. [2018-01-30 02:26:01,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:26:01,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 565 [2018-01-30 02:26:01,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:26:01,333 INFO L225 Difference]: With dead ends: 18796 [2018-01-30 02:26:01,333 INFO L226 Difference]: Without dead ends: 10194 [2018-01-30 02:26:01,339 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:26:01,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10194 states. [2018-01-30 02:26:01,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10194 to 8750. [2018-01-30 02:26:01,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8750 states. [2018-01-30 02:26:01,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8750 states to 8750 states and 10179 transitions. [2018-01-30 02:26:01,604 INFO L78 Accepts]: Start accepts. Automaton has 8750 states and 10179 transitions. Word has length 565 [2018-01-30 02:26:01,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:26:01,604 INFO L432 AbstractCegarLoop]: Abstraction has 8750 states and 10179 transitions. [2018-01-30 02:26:01,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:26:01,604 INFO L276 IsEmpty]: Start isEmpty. Operand 8750 states and 10179 transitions. [2018-01-30 02:26:01,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2018-01-30 02:26:01,609 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:26:01,609 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:01,609 INFO L371 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:26:01,609 INFO L82 PathProgramCache]: Analyzing trace with hash -99800948, now seen corresponding path program 1 times [2018-01-30 02:26:01,609 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:26:01,609 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:26:01,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:26:01,610 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:26:01,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:26:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:26:01,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:26:01,931 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 500 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-01-30 02:26:01,931 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:26:01,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:26:01,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:26:01,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:26:01,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:26:01,932 INFO L87 Difference]: Start difference. First operand 8750 states and 10179 transitions. Second operand 4 states. [2018-01-30 02:26:02,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:26:02,438 INFO L93 Difference]: Finished difference Result 18812 states and 21870 transitions. [2018-01-30 02:26:02,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:26:02,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 568 [2018-01-30 02:26:02,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:26:02,444 INFO L225 Difference]: With dead ends: 18812 [2018-01-30 02:26:02,445 INFO L226 Difference]: Without dead ends: 10186 [2018-01-30 02:26:02,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:26:02,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10186 states. [2018-01-30 02:26:02,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10186 to 8774. [2018-01-30 02:26:02,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8774 states. [2018-01-30 02:26:02,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8774 states to 8774 states and 10203 transitions. [2018-01-30 02:26:02,713 INFO L78 Accepts]: Start accepts. Automaton has 8774 states and 10203 transitions. Word has length 568 [2018-01-30 02:26:02,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:26:02,713 INFO L432 AbstractCegarLoop]: Abstraction has 8774 states and 10203 transitions. [2018-01-30 02:26:02,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:26:02,713 INFO L276 IsEmpty]: Start isEmpty. Operand 8774 states and 10203 transitions. [2018-01-30 02:26:02,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-01-30 02:26:02,718 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:26:02,718 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:02,718 INFO L371 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:26:02,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1204141861, now seen corresponding path program 1 times [2018-01-30 02:26:02,718 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:26:02,718 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:26:02,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:26:02,719 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:26:02,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:26:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:26:02,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:26:03,025 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 518 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-01-30 02:26:03,025 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:26:03,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:26:03,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:26:03,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:26:03,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:26:03,026 INFO L87 Difference]: Start difference. First operand 8774 states and 10203 transitions. Second operand 4 states. [2018-01-30 02:26:03,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:26:03,512 INFO L93 Difference]: Finished difference Result 18652 states and 21686 transitions. [2018-01-30 02:26:03,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:26:03,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 571 [2018-01-30 02:26:03,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:26:03,518 INFO L225 Difference]: With dead ends: 18652 [2018-01-30 02:26:03,518 INFO L226 Difference]: Without dead ends: 10002 [2018-01-30 02:26:03,524 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:26:03,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10002 states. [2018-01-30 02:26:03,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10002 to 8798. [2018-01-30 02:26:03,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8798 states. [2018-01-30 02:26:03,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8798 states to 8798 states and 10227 transitions. [2018-01-30 02:26:03,786 INFO L78 Accepts]: Start accepts. Automaton has 8798 states and 10227 transitions. Word has length 571 [2018-01-30 02:26:03,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:26:03,787 INFO L432 AbstractCegarLoop]: Abstraction has 8798 states and 10227 transitions. [2018-01-30 02:26:03,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:26:03,787 INFO L276 IsEmpty]: Start isEmpty. Operand 8798 states and 10227 transitions. [2018-01-30 02:26:03,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-01-30 02:26:03,791 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:26:03,792 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2018-01-30 02:26:03,792 INFO L371 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:26:03,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1726401252, now seen corresponding path program 1 times [2018-01-30 02:26:03,792 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:26:03,792 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:26:03,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:26:03,793 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:26:03,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:26:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:26:03,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:26:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 495 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-01-30 02:26:04,299 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:26:04,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:26:04,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:26:04,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:26:04,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:26:04,300 INFO L87 Difference]: Start difference. First operand 8798 states and 10227 transitions. Second operand 4 states. [2018-01-30 02:26:04,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:26:04,783 INFO L93 Difference]: Finished difference Result 18475 states and 21489 transitions. [2018-01-30 02:26:04,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:26:04,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 571 [2018-01-30 02:26:04,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:26:04,790 INFO L225 Difference]: With dead ends: 18475 [2018-01-30 02:26:04,790 INFO L226 Difference]: Without dead ends: 9801 [2018-01-30 02:26:04,797 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:26:04,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9801 states. [2018-01-30 02:26:05,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9801 to 9286. [2018-01-30 02:26:05,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9286 states. [2018-01-30 02:26:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 10835 transitions. [2018-01-30 02:26:05,120 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 10835 transitions. Word has length 571 [2018-01-30 02:26:05,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:26:05,120 INFO L432 AbstractCegarLoop]: Abstraction has 9286 states and 10835 transitions. [2018-01-30 02:26:05,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:26:05,121 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 10835 transitions. [2018-01-30 02:26:05,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2018-01-30 02:26:05,125 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:26:05,126 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:05,126 INFO L371 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:26:05,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1772007081, now seen corresponding path program 1 times [2018-01-30 02:26:05,126 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:26:05,126 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:26:05,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:26:05,127 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:26:05,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:26:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:26:05,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:26:05,349 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2018-01-30 02:26:05,349 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:26:05,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:26:05,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:26:05,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:26:05,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:26:05,349 INFO L87 Difference]: Start difference. First operand 9286 states and 10835 transitions. Second operand 4 states. [2018-01-30 02:26:05,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:26:05,825 INFO L93 Difference]: Finished difference Result 19104 states and 22295 transitions. [2018-01-30 02:26:05,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:26:05,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 572 [2018-01-30 02:26:05,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:26:05,831 INFO L225 Difference]: With dead ends: 19104 [2018-01-30 02:26:05,831 INFO L226 Difference]: Without dead ends: 9942 [2018-01-30 02:26:05,838 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:26:05,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9942 states. [2018-01-30 02:26:06,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9942 to 9630. [2018-01-30 02:26:06,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9630 states. [2018-01-30 02:26:06,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9630 states to 9630 states and 11251 transitions. [2018-01-30 02:26:06,118 INFO L78 Accepts]: Start accepts. Automaton has 9630 states and 11251 transitions. Word has length 572 [2018-01-30 02:26:06,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:26:06,118 INFO L432 AbstractCegarLoop]: Abstraction has 9630 states and 11251 transitions. [2018-01-30 02:26:06,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:26:06,118 INFO L276 IsEmpty]: Start isEmpty. Operand 9630 states and 11251 transitions. [2018-01-30 02:26:06,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2018-01-30 02:26:06,123 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:26:06,123 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:06,123 INFO L371 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:26:06,123 INFO L82 PathProgramCache]: Analyzing trace with hash 860902993, now seen corresponding path program 1 times [2018-01-30 02:26:06,124 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:26:06,124 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:26:06,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:26:06,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:26:06,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:26:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:26:06,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:26:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 496 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-01-30 02:26:06,516 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:26:06,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 02:26:06,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 02:26:06,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 02:26:06,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-30 02:26:06,517 INFO L87 Difference]: Start difference. First operand 9630 states and 11251 transitions. Second operand 7 states. [2018-01-30 02:26:08,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:26:08,110 INFO L93 Difference]: Finished difference Result 32347 states and 37686 transitions. [2018-01-30 02:26:08,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:26:08,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 573 [2018-01-30 02:26:08,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:26:08,124 INFO L225 Difference]: With dead ends: 32347 [2018-01-30 02:26:08,124 INFO L226 Difference]: Without dead ends: 22841 [2018-01-30 02:26:08,135 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:26:08,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22841 states. [2018-01-30 02:26:08,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22841 to 10366. [2018-01-30 02:26:08,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10366 states. [2018-01-30 02:26:08,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10366 states to 10366 states and 12195 transitions. [2018-01-30 02:26:08,462 INFO L78 Accepts]: Start accepts. Automaton has 10366 states and 12195 transitions. Word has length 573 [2018-01-30 02:26:08,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:26:08,462 INFO L432 AbstractCegarLoop]: Abstraction has 10366 states and 12195 transitions. [2018-01-30 02:26:08,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 02:26:08,462 INFO L276 IsEmpty]: Start isEmpty. Operand 10366 states and 12195 transitions. [2018-01-30 02:26:08,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2018-01-30 02:26:08,467 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:26:08,468 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:08,468 INFO L371 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:26:08,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1322946228, now seen corresponding path program 1 times [2018-01-30 02:26:08,468 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:26:08,468 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:26:08,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:26:08,469 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:26:08,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:26:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:26:08,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:26:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2018-01-30 02:26:08,922 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:26:08,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 02:26:08,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 02:26:08,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 02:26:08,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:26:08,923 INFO L87 Difference]: Start difference. First operand 10366 states and 12195 transitions. Second operand 5 states. [2018-01-30 02:26:09,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:26:09,371 INFO L93 Difference]: Finished difference Result 20608 states and 24263 transitions. [2018-01-30 02:26:09,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 02:26:09,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 573 [2018-01-30 02:26:09,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:26:09,378 INFO L225 Difference]: With dead ends: 20608 [2018-01-30 02:26:09,378 INFO L226 Difference]: Without dead ends: 10366 [2018-01-30 02:26:09,385 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-30 02:26:09,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10366 states. [2018-01-30 02:26:09,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10366 to 10366. [2018-01-30 02:26:09,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10366 states. [2018-01-30 02:26:09,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10366 states to 10366 states and 12187 transitions. [2018-01-30 02:26:09,676 INFO L78 Accepts]: Start accepts. Automaton has 10366 states and 12187 transitions. Word has length 573 [2018-01-30 02:26:09,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:26:09,677 INFO L432 AbstractCegarLoop]: Abstraction has 10366 states and 12187 transitions. [2018-01-30 02:26:09,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 02:26:09,677 INFO L276 IsEmpty]: Start isEmpty. Operand 10366 states and 12187 transitions. [2018-01-30 02:26:09,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2018-01-30 02:26:09,682 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:26:09,682 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:09,682 INFO L371 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:26:09,683 INFO L82 PathProgramCache]: Analyzing trace with hash 506516219, now seen corresponding path program 1 times [2018-01-30 02:26:09,683 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:26:09,683 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:26:09,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:26:09,683 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:26:09,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:26:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:26:09,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:26:10,105 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-01-30 02:26:10,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:26:10,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:26:10,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:26:10,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:26:10,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:26:10,106 INFO L87 Difference]: Start difference. First operand 10366 states and 12187 transitions. Second operand 6 states. [2018-01-30 02:26:11,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:26:11,228 INFO L93 Difference]: Finished difference Result 31427 states and 36772 transitions. [2018-01-30 02:26:11,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:26:11,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 575 [2018-01-30 02:26:11,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:26:11,241 INFO L225 Difference]: With dead ends: 31427 [2018-01-30 02:26:11,241 INFO L226 Difference]: Without dead ends: 21185 [2018-01-30 02:26:11,250 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:26:11,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21185 states. [2018-01-30 02:26:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21185 to 10366. [2018-01-30 02:26:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10366 states. [2018-01-30 02:26:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10366 states to 10366 states and 12179 transitions. [2018-01-30 02:26:11,579 INFO L78 Accepts]: Start accepts. Automaton has 10366 states and 12179 transitions. Word has length 575 [2018-01-30 02:26:11,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:26:11,579 INFO L432 AbstractCegarLoop]: Abstraction has 10366 states and 12179 transitions. [2018-01-30 02:26:11,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:26:11,579 INFO L276 IsEmpty]: Start isEmpty. Operand 10366 states and 12179 transitions. [2018-01-30 02:26:11,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2018-01-30 02:26:11,585 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:26:11,585 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:11,585 INFO L371 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:26:11,585 INFO L82 PathProgramCache]: Analyzing trace with hash 849689216, now seen corresponding path program 1 times [2018-01-30 02:26:11,585 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:26:11,585 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:26:11,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:26:11,586 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:26:11,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:26:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:26:11,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:26:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 827 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2018-01-30 02:26:12,135 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:26:12,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:26:12,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:26:12,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:26:12,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:26:12,136 INFO L87 Difference]: Start difference. First operand 10366 states and 12179 transitions. Second operand 6 states. Received shutdown request... [2018-01-30 02:26:12,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 02:26:12,679 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 02:26:12,682 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 02:26:12,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:26:12 BoogieIcfgContainer [2018-01-30 02:26:12,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 02:26:12,683 INFO L168 Benchmark]: Toolchain (without parser) took 66909.63 ms. Allocated memory was 147.8 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 110.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 665.6 MB. Max. memory is 5.3 GB. [2018-01-30 02:26:12,684 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 147.8 MB. Free memory is still 117.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 02:26:12,684 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.63 ms. Allocated memory is still 147.8 MB. Free memory was 110.5 MB in the beginning and 82.3 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 5.3 GB. [2018-01-30 02:26:12,684 INFO L168 Benchmark]: Boogie Preprocessor took 49.80 ms. Allocated memory is still 147.8 MB. Free memory was 82.3 MB in the beginning and 78.8 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:26:12,684 INFO L168 Benchmark]: RCFGBuilder took 1838.72 ms. Allocated memory was 147.8 MB in the beginning and 169.3 MB in the end (delta: 21.5 MB). Free memory was 78.8 MB in the beginning and 106.4 MB in the end (delta: -27.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. [2018-01-30 02:26:12,684 INFO L168 Benchmark]: TraceAbstraction took 64802.25 ms. Allocated memory was 169.3 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 105.2 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 638.9 MB. Max. memory is 5.3 GB. [2018-01-30 02:26:12,685 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.37 ms. Allocated memory is still 147.8 MB. Free memory is still 117.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.63 ms. Allocated memory is still 147.8 MB. Free memory was 110.5 MB in the beginning and 82.3 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 49.80 ms. Allocated memory is still 147.8 MB. Free memory was 82.3 MB in the beginning and 78.8 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 5.3 GB. * RCFGBuilder took 1838.72 ms. Allocated memory was 147.8 MB in the beginning and 169.3 MB in the end (delta: 21.5 MB). Free memory was 78.8 MB in the beginning and 106.4 MB in the end (delta: -27.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 64802.25 ms. Allocated memory was 169.3 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 105.2 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 638.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1732]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1732). Cancelled while BasicCegarLoop was constructing difference of abstraction (10366states) and interpolant automaton (currently 8 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (2064 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 608 locations, 1 error locations. TIMEOUT Result, 64.7s OverallTime, 83 OverallIterations, 7 TraceHistogramMax, 38.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 77886 SDtfs, 38026 SDslu, 168570 SDs, 0 SdLazy, 38562 SolverSat, 1269 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 782 GetRequests, 256 SyntacticMatches, 148 SemanticMatches, 378 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10366occurred in iteration=80, 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: 6.3s AutomataMinimizationTime, 82 MinimizatonAttempts, 94287 StatesRemovedByMinimization, 76 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 28867 NumberOfCodeBlocks, 28867 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 28784 ConstructedInterpolants, 0 QuantifiedInterpolants, 25671739 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 83 InterpolantComputations, 83 PerfectInterpolantSequences, 22614/22614 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.13_true-unreach-call.i.cil.c_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_02-26-12-695.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr.blast.13_true-unreach-call.i.cil.c_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_02-26-12-695.csv Completed graceful shutdown