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-simplified/s3_srvr_6_true-unreach-call_false-termination.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 01:46:14,270 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 01:46:14,271 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 01:46:14,280 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 01:46:14,280 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 01:46:14,281 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 01:46:14,281 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 01:46:14,282 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 01:46:14,283 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 01:46:14,284 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 01:46:14,288 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 01:46:14,288 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 01:46:14,289 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 01:46:14,289 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 01:46:14,290 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 01:46:14,291 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 01:46:14,292 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 01:46:14,295 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 01:46:14,295 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 01:46:14,296 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 01:46:14,297 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 01:46:14,297 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 01:46:14,297 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 01:46:14,298 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 01:46:14,298 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 01:46:14,301 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 01:46:14,301 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 01:46:14,302 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 01:46:14,302 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 01:46:14,302 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 01:46:14,302 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 01:46:14,303 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 01:46:14,311 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 01:46:14,311 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 01:46:14,312 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 01:46:14,316 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 01:46:14,316 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 01:46:14,316 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 01:46:14,316 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 01:46:14,316 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 01:46:14,316 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 01:46:14,316 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 01:46:14,316 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 01:46:14,317 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 01:46:14,317 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 01:46:14,317 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 01:46:14,317 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 01:46:14,317 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 01:46:14,317 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 01:46:14,317 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 01:46:14,317 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 01:46:14,317 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 01:46:14,317 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 01:46:14,317 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 01:46:14,317 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 01:46:14,318 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:46:14,318 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 01:46:14,318 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 01:46:14,318 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 01:46:14,318 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 01:46:14,318 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 01:46:14,318 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 01:46:14,318 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 01:46:14,318 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 01:46:14,320 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 01:46:14,320 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 01:46:14,351 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 01:46:14,359 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 01:46:14,361 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 01:46:14,363 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 01:46:14,363 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 01:46:14,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_6_true-unreach-call_false-termination.cil.c [2018-01-30 01:46:14,443 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 01:46:14,444 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 01:46:14,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 01:46:14,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 01:46:14,448 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 01:46:14,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:46:14" (1/1) ... [2018-01-30 01:46:14,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58379aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:46:14, skipping insertion in model container [2018-01-30 01:46:14,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:46:14" (1/1) ... [2018-01-30 01:46:14,459 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:46:14,481 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:46:14,574 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:46:14,597 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:46:14,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:46:14 WrapperNode [2018-01-30 01:46:14,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 01:46:14,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 01:46:14,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 01:46:14,604 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 01:46:14,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:46:14" (1/1) ... [2018-01-30 01:46:14,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:46:14" (1/1) ... [2018-01-30 01:46:14,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:46:14" (1/1) ... [2018-01-30 01:46:14,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:46:14" (1/1) ... [2018-01-30 01:46:14,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:46:14" (1/1) ... [2018-01-30 01:46:14,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:46:14" (1/1) ... [2018-01-30 01:46:14,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:46:14" (1/1) ... [2018-01-30 01:46:14,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 01:46:14,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 01:46:14,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 01:46:14,655 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 01:46:14,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:46:14" (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 01:46:14,692 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 01:46:14,692 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 01:46:14,692 INFO L136 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-01-30 01:46:14,692 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 01:46:14,692 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 01:46:14,692 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 01:46:14,692 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-01-30 01:46:14,693 INFO L128 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-01-30 01:46:14,693 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 01:46:14,693 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 01:46:14,693 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 01:46:14,859 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 01:46:14,859 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 01:46:15,707 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 01:46:15,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:46:15 BoogieIcfgContainer [2018-01-30 01:46:15,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 01:46:15,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 01:46:15,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 01:46:15,710 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 01:46:15,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 01:46:14" (1/3) ... [2018-01-30 01:46:15,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a2b685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:46:15, skipping insertion in model container [2018-01-30 01:46:15,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:46:14" (2/3) ... [2018-01-30 01:46:15,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a2b685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:46:15, skipping insertion in model container [2018-01-30 01:46:15,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:46:15" (3/3) ... [2018-01-30 01:46:15,711 INFO L107 eAbstractionObserver]: Analyzing ICFG s3_srvr_6_true-unreach-call_false-termination.cil.c [2018-01-30 01:46:15,716 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 01:46:15,723 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 01:46:15,751 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 01:46:15,752 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 01:46:15,752 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 01:46:15,752 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 01:46:15,752 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 01:46:15,752 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 01:46:15,752 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 01:46:15,752 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 01:46:15,753 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 01:46:15,765 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states. [2018-01-30 01:46:15,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-01-30 01:46:15,775 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:15,776 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:46:15,776 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:15,778 INFO L82 PathProgramCache]: Analyzing trace with hash 21430928, now seen corresponding path program 1 times [2018-01-30 01:46:15,779 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:15,780 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:15,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:15,808 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:15,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:15,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:16,018 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 01:46:16,019 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:16,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:16,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:16,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:16,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:16,097 INFO L87 Difference]: Start difference. First operand 444 states. Second operand 3 states. [2018-01-30 01:46:16,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:16,336 INFO L93 Difference]: Finished difference Result 1014 states and 1353 transitions. [2018-01-30 01:46:16,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:16,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2018-01-30 01:46:16,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:16,348 INFO L225 Difference]: With dead ends: 1014 [2018-01-30 01:46:16,348 INFO L226 Difference]: Without dead ends: 651 [2018-01-30 01:46:16,351 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 01:46:16,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-01-30 01:46:16,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2018-01-30 01:46:16,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-01-30 01:46:16,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 797 transitions. [2018-01-30 01:46:16,393 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 797 transitions. Word has length 180 [2018-01-30 01:46:16,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:16,393 INFO L432 AbstractCegarLoop]: Abstraction has 651 states and 797 transitions. [2018-01-30 01:46:16,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:16,393 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 797 transitions. [2018-01-30 01:46:16,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-01-30 01:46:16,397 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:16,397 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:46:16,397 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:16,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1488178796, now seen corresponding path program 1 times [2018-01-30 01:46:16,398 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:16,398 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:16,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:16,399 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:16,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:16,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:16,504 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:46:16,505 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:16,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:16,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:16,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:16,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:16,507 INFO L87 Difference]: Start difference. First operand 651 states and 797 transitions. Second operand 3 states. [2018-01-30 01:46:16,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:16,814 INFO L93 Difference]: Finished difference Result 1231 states and 1556 transitions. [2018-01-30 01:46:16,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:16,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2018-01-30 01:46:16,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:16,819 INFO L225 Difference]: With dead ends: 1231 [2018-01-30 01:46:16,819 INFO L226 Difference]: Without dead ends: 722 [2018-01-30 01:46:16,821 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 01:46:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-01-30 01:46:16,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 701. [2018-01-30 01:46:16,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2018-01-30 01:46:16,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 857 transitions. [2018-01-30 01:46:16,834 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 857 transitions. Word has length 204 [2018-01-30 01:46:16,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:16,834 INFO L432 AbstractCegarLoop]: Abstraction has 701 states and 857 transitions. [2018-01-30 01:46:16,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:16,835 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 857 transitions. [2018-01-30 01:46:16,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-01-30 01:46:16,836 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:16,837 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:46:16,837 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:16,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1289307497, now seen corresponding path program 1 times [2018-01-30 01:46:16,837 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:16,837 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:16,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:16,838 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:16,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:16,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:46:16,947 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:16,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:16,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:16,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:16,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:16,948 INFO L87 Difference]: Start difference. First operand 701 states and 857 transitions. Second operand 3 states. [2018-01-30 01:46:17,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:17,259 INFO L93 Difference]: Finished difference Result 1260 states and 1589 transitions. [2018-01-30 01:46:17,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:17,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-01-30 01:46:17,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:17,262 INFO L225 Difference]: With dead ends: 1260 [2018-01-30 01:46:17,262 INFO L226 Difference]: Without dead ends: 969 [2018-01-30 01:46:17,262 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 01:46:17,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2018-01-30 01:46:17,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 969. [2018-01-30 01:46:17,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2018-01-30 01:46:17,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1192 transitions. [2018-01-30 01:46:17,275 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1192 transitions. Word has length 211 [2018-01-30 01:46:17,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:17,275 INFO L432 AbstractCegarLoop]: Abstraction has 969 states and 1192 transitions. [2018-01-30 01:46:17,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:17,275 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1192 transitions. [2018-01-30 01:46:17,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-01-30 01:46:17,277 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:17,277 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:46:17,278 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:17,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1644411359, now seen corresponding path program 1 times [2018-01-30 01:46:17,278 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:17,278 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:17,278 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:17,279 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:17,279 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:17,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:17,370 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 01:46:17,371 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:17,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:17,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:17,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:17,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:17,371 INFO L87 Difference]: Start difference. First operand 969 states and 1192 transitions. Second operand 3 states. [2018-01-30 01:46:17,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:17,880 INFO L93 Difference]: Finished difference Result 1914 states and 2417 transitions. [2018-01-30 01:46:17,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:17,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-01-30 01:46:17,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:17,898 INFO L225 Difference]: With dead ends: 1914 [2018-01-30 01:46:17,898 INFO L226 Difference]: Without dead ends: 1087 [2018-01-30 01:46:17,899 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 01:46:17,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2018-01-30 01:46:17,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1053. [2018-01-30 01:46:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2018-01-30 01:46:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1291 transitions. [2018-01-30 01:46:17,910 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1291 transitions. Word has length 230 [2018-01-30 01:46:17,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:17,912 INFO L432 AbstractCegarLoop]: Abstraction has 1053 states and 1291 transitions. [2018-01-30 01:46:17,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:17,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1291 transitions. [2018-01-30 01:46:17,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-01-30 01:46:17,914 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:17,915 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:46:17,915 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:17,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1706740095, now seen corresponding path program 1 times [2018-01-30 01:46:17,915 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:17,915 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:17,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:17,916 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:17,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:17,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:18,008 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 01:46:18,008 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:18,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:18,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:18,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:18,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:18,009 INFO L87 Difference]: Start difference. First operand 1053 states and 1291 transitions. Second operand 3 states. [2018-01-30 01:46:18,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:18,768 INFO L93 Difference]: Finished difference Result 2165 states and 2760 transitions. [2018-01-30 01:46:18,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:18,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-01-30 01:46:18,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:18,771 INFO L225 Difference]: With dead ends: 2165 [2018-01-30 01:46:18,771 INFO L226 Difference]: Without dead ends: 1254 [2018-01-30 01:46:18,772 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 01:46:18,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2018-01-30 01:46:18,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1185. [2018-01-30 01:46:18,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2018-01-30 01:46:18,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1447 transitions. [2018-01-30 01:46:18,786 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1447 transitions. Word has length 230 [2018-01-30 01:46:18,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:18,786 INFO L432 AbstractCegarLoop]: Abstraction has 1185 states and 1447 transitions. [2018-01-30 01:46:18,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:18,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1447 transitions. [2018-01-30 01:46:18,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-01-30 01:46:18,788 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:18,788 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:46:18,789 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:18,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1051748412, now seen corresponding path program 1 times [2018-01-30 01:46:18,789 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:18,789 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:18,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:18,790 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:18,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:18,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:46:18,867 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:18,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:18,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:18,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:18,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:18,867 INFO L87 Difference]: Start difference. First operand 1185 states and 1447 transitions. Second operand 3 states. [2018-01-30 01:46:18,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:18,892 INFO L93 Difference]: Finished difference Result 3166 states and 3896 transitions. [2018-01-30 01:46:18,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:18,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2018-01-30 01:46:18,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:18,896 INFO L225 Difference]: With dead ends: 3166 [2018-01-30 01:46:18,896 INFO L226 Difference]: Without dead ends: 2123 [2018-01-30 01:46:18,898 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 01:46:18,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2018-01-30 01:46:18,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2121. [2018-01-30 01:46:18,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2121 states. [2018-01-30 01:46:18,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2582 transitions. [2018-01-30 01:46:18,920 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2582 transitions. Word has length 237 [2018-01-30 01:46:18,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:18,920 INFO L432 AbstractCegarLoop]: Abstraction has 2121 states and 2582 transitions. [2018-01-30 01:46:18,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:18,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2582 transitions. [2018-01-30 01:46:18,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-01-30 01:46:18,923 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:18,923 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:46:18,923 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:18,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1944303584, now seen corresponding path program 1 times [2018-01-30 01:46:18,923 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:18,923 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:18,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:18,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:18,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:18,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 01:46:19,016 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:19,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:19,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:19,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:19,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:19,017 INFO L87 Difference]: Start difference. First operand 2121 states and 2582 transitions. Second operand 3 states. [2018-01-30 01:46:19,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:19,145 INFO L93 Difference]: Finished difference Result 4139 states and 5063 transitions. [2018-01-30 01:46:19,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:19,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2018-01-30 01:46:19,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:19,149 INFO L225 Difference]: With dead ends: 4139 [2018-01-30 01:46:19,149 INFO L226 Difference]: Without dead ends: 2160 [2018-01-30 01:46:19,151 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 01:46:19,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2018-01-30 01:46:19,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 2139. [2018-01-30 01:46:19,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2139 states. [2018-01-30 01:46:19,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2594 transitions. [2018-01-30 01:46:19,174 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2594 transitions. Word has length 238 [2018-01-30 01:46:19,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:19,174 INFO L432 AbstractCegarLoop]: Abstraction has 2139 states and 2594 transitions. [2018-01-30 01:46:19,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2594 transitions. [2018-01-30 01:46:19,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-01-30 01:46:19,178 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:19,178 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-30 01:46:19,178 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:19,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1146974672, now seen corresponding path program 1 times [2018-01-30 01:46:19,178 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:19,178 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:19,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:19,179 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:19,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:19,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:19,253 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:46:19,253 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:19,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:19,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:19,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:19,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:19,254 INFO L87 Difference]: Start difference. First operand 2139 states and 2594 transitions. Second operand 3 states. [2018-01-30 01:46:19,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:19,339 INFO L93 Difference]: Finished difference Result 6118 states and 7465 transitions. [2018-01-30 01:46:19,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:19,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2018-01-30 01:46:19,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:19,353 INFO L225 Difference]: With dead ends: 6118 [2018-01-30 01:46:19,353 INFO L226 Difference]: Without dead ends: 4121 [2018-01-30 01:46:19,356 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 01:46:19,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4121 states. [2018-01-30 01:46:19,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4121 to 4119. [2018-01-30 01:46:19,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4119 states. [2018-01-30 01:46:19,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4119 states to 4119 states and 4998 transitions. [2018-01-30 01:46:19,402 INFO L78 Accepts]: Start accepts. Automaton has 4119 states and 4998 transitions. Word has length 240 [2018-01-30 01:46:19,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:19,402 INFO L432 AbstractCegarLoop]: Abstraction has 4119 states and 4998 transitions. [2018-01-30 01:46:19,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:19,402 INFO L276 IsEmpty]: Start isEmpty. Operand 4119 states and 4998 transitions. [2018-01-30 01:46:19,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-01-30 01:46:19,408 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:19,408 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-30 01:46:19,408 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:19,408 INFO L82 PathProgramCache]: Analyzing trace with hash -214468492, now seen corresponding path program 1 times [2018-01-30 01:46:19,408 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:19,408 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:19,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:19,409 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:19,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:19,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 01:46:19,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:19,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:19,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:19,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:19,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:19,521 INFO L87 Difference]: Start difference. First operand 4119 states and 4998 transitions. Second operand 3 states. [2018-01-30 01:46:20,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:20,158 INFO L93 Difference]: Finished difference Result 8090 states and 9926 transitions. [2018-01-30 01:46:20,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:20,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2018-01-30 01:46:20,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:20,169 INFO L225 Difference]: With dead ends: 8090 [2018-01-30 01:46:20,169 INFO L226 Difference]: Without dead ends: 5414 [2018-01-30 01:46:20,172 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 01:46:20,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5414 states. [2018-01-30 01:46:20,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5414 to 5414. [2018-01-30 01:46:20,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5414 states. [2018-01-30 01:46:20,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5414 states to 5414 states and 6563 transitions. [2018-01-30 01:46:20,232 INFO L78 Accepts]: Start accepts. Automaton has 5414 states and 6563 transitions. Word has length 241 [2018-01-30 01:46:20,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:20,233 INFO L432 AbstractCegarLoop]: Abstraction has 5414 states and 6563 transitions. [2018-01-30 01:46:20,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:20,233 INFO L276 IsEmpty]: Start isEmpty. Operand 5414 states and 6563 transitions. [2018-01-30 01:46:20,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-01-30 01:46:20,240 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:20,240 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:46:20,240 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:20,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1487446538, now seen corresponding path program 1 times [2018-01-30 01:46:20,240 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:20,240 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:20,241 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:20,241 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:20,241 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:20,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:20,354 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-30 01:46:20,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:20,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:20,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:20,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:20,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:20,355 INFO L87 Difference]: Start difference. First operand 5414 states and 6563 transitions. Second operand 3 states. [2018-01-30 01:46:20,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:20,740 INFO L93 Difference]: Finished difference Result 11528 states and 14248 transitions. [2018-01-30 01:46:20,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:20,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2018-01-30 01:46:20,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:20,751 INFO L225 Difference]: With dead ends: 11528 [2018-01-30 01:46:20,751 INFO L226 Difference]: Without dead ends: 6262 [2018-01-30 01:46:20,757 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 01:46:20,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6262 states. [2018-01-30 01:46:20,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6262 to 5826. [2018-01-30 01:46:20,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5826 states. [2018-01-30 01:46:20,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5826 states to 5826 states and 7015 transitions. [2018-01-30 01:46:20,810 INFO L78 Accepts]: Start accepts. Automaton has 5826 states and 7015 transitions. Word has length 259 [2018-01-30 01:46:20,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:20,811 INFO L432 AbstractCegarLoop]: Abstraction has 5826 states and 7015 transitions. [2018-01-30 01:46:20,811 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:20,811 INFO L276 IsEmpty]: Start isEmpty. Operand 5826 states and 7015 transitions. [2018-01-30 01:46:20,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-01-30 01:46:20,817 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:20,818 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:20,818 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:20,818 INFO L82 PathProgramCache]: Analyzing trace with hash 507470061, now seen corresponding path program 1 times [2018-01-30 01:46:20,818 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:20,818 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:20,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:20,819 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:20,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:20,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:20,920 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-30 01:46:20,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:20,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:20,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:20,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:20,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:20,921 INFO L87 Difference]: Start difference. First operand 5826 states and 7015 transitions. Second operand 3 states. [2018-01-30 01:46:21,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:21,347 INFO L93 Difference]: Finished difference Result 11504 states and 13960 transitions. [2018-01-30 01:46:21,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:21,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2018-01-30 01:46:21,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:21,360 INFO L225 Difference]: With dead ends: 11504 [2018-01-30 01:46:21,361 INFO L226 Difference]: Without dead ends: 7224 [2018-01-30 01:46:21,366 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 01:46:21,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2018-01-30 01:46:21,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 7224. [2018-01-30 01:46:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7224 states. [2018-01-30 01:46:21,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7224 states to 7224 states and 8697 transitions. [2018-01-30 01:46:21,426 INFO L78 Accepts]: Start accepts. Automaton has 7224 states and 8697 transitions. Word has length 274 [2018-01-30 01:46:21,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:21,426 INFO L432 AbstractCegarLoop]: Abstraction has 7224 states and 8697 transitions. [2018-01-30 01:46:21,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:21,426 INFO L276 IsEmpty]: Start isEmpty. Operand 7224 states and 8697 transitions. [2018-01-30 01:46:21,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-01-30 01:46:21,433 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:21,433 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:46:21,434 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:21,434 INFO L82 PathProgramCache]: Analyzing trace with hash 794667443, now seen corresponding path program 1 times [2018-01-30 01:46:21,434 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:21,434 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:21,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:21,434 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:21,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:21,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-01-30 01:46:21,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:21,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:21,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:21,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:21,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:21,547 INFO L87 Difference]: Start difference. First operand 7224 states and 8697 transitions. Second operand 3 states. [2018-01-30 01:46:21,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:21,754 INFO L93 Difference]: Finished difference Result 15309 states and 18763 transitions. [2018-01-30 01:46:21,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:21,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2018-01-30 01:46:21,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:21,764 INFO L225 Difference]: With dead ends: 15309 [2018-01-30 01:46:21,764 INFO L226 Difference]: Without dead ends: 8233 [2018-01-30 01:46:21,772 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 01:46:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8233 states. [2018-01-30 01:46:21,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8233 to 7779. [2018-01-30 01:46:21,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7779 states. [2018-01-30 01:46:21,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7779 states to 7779 states and 9302 transitions. [2018-01-30 01:46:21,837 INFO L78 Accepts]: Start accepts. Automaton has 7779 states and 9302 transitions. Word has length 293 [2018-01-30 01:46:21,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:21,837 INFO L432 AbstractCegarLoop]: Abstraction has 7779 states and 9302 transitions. [2018-01-30 01:46:21,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:21,837 INFO L276 IsEmpty]: Start isEmpty. Operand 7779 states and 9302 transitions. [2018-01-30 01:46:21,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-01-30 01:46:21,844 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:21,844 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:21,844 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:21,844 INFO L82 PathProgramCache]: Analyzing trace with hash 235889728, now seen corresponding path program 1 times [2018-01-30 01:46:21,845 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:21,845 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:21,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:21,845 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:21,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:21,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-01-30 01:46:21,926 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:21,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:21,926 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:21,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:21,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:21,927 INFO L87 Difference]: Start difference. First operand 7779 states and 9302 transitions. Second operand 3 states. [2018-01-30 01:46:22,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:22,121 INFO L93 Difference]: Finished difference Result 15410 states and 18534 transitions. [2018-01-30 01:46:22,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:22,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2018-01-30 01:46:22,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:22,129 INFO L225 Difference]: With dead ends: 15410 [2018-01-30 01:46:22,129 INFO L226 Difference]: Without dead ends: 9288 [2018-01-30 01:46:22,135 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 01:46:22,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9288 states. [2018-01-30 01:46:22,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9288 to 9288. [2018-01-30 01:46:22,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9288 states. [2018-01-30 01:46:22,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9288 states to 9288 states and 11109 transitions. [2018-01-30 01:46:22,203 INFO L78 Accepts]: Start accepts. Automaton has 9288 states and 11109 transitions. Word has length 312 [2018-01-30 01:46:22,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:22,204 INFO L432 AbstractCegarLoop]: Abstraction has 9288 states and 11109 transitions. [2018-01-30 01:46:22,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:22,204 INFO L276 IsEmpty]: Start isEmpty. Operand 9288 states and 11109 transitions. [2018-01-30 01:46:22,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-01-30 01:46:22,212 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:22,212 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:22,212 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:22,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1434956789, now seen corresponding path program 1 times [2018-01-30 01:46:22,213 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:22,213 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:22,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:22,213 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:22,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:22,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:22,309 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-01-30 01:46:22,309 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:22,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:22,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:22,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:22,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:22,310 INFO L87 Difference]: Start difference. First operand 9288 states and 11109 transitions. Second operand 3 states. [2018-01-30 01:46:23,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:23,026 INFO L93 Difference]: Finished difference Result 19178 states and 23378 transitions. [2018-01-30 01:46:23,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:23,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2018-01-30 01:46:23,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:23,035 INFO L225 Difference]: With dead ends: 19178 [2018-01-30 01:46:23,036 INFO L226 Difference]: Without dead ends: 10038 [2018-01-30 01:46:23,041 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 01:46:23,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10038 states. [2018-01-30 01:46:23,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10038 to 10026. [2018-01-30 01:46:23,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10026 states. [2018-01-30 01:46:23,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10026 states to 10026 states and 11883 transitions. [2018-01-30 01:46:23,119 INFO L78 Accepts]: Start accepts. Automaton has 10026 states and 11883 transitions. Word has length 330 [2018-01-30 01:46:23,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:23,119 INFO L432 AbstractCegarLoop]: Abstraction has 10026 states and 11883 transitions. [2018-01-30 01:46:23,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:23,119 INFO L276 IsEmpty]: Start isEmpty. Operand 10026 states and 11883 transitions. [2018-01-30 01:46:23,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-01-30 01:46:23,128 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:23,129 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:23,129 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:23,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1292536088, now seen corresponding path program 1 times [2018-01-30 01:46:23,129 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:23,129 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:23,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:23,130 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:23,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:23,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-01-30 01:46:23,235 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:23,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:23,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:23,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:23,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:23,236 INFO L87 Difference]: Start difference. First operand 10026 states and 11883 transitions. Second operand 3 states. [2018-01-30 01:46:23,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:23,380 INFO L93 Difference]: Finished difference Result 19904 states and 23696 transitions. [2018-01-30 01:46:23,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:23,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 353 [2018-01-30 01:46:23,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:23,390 INFO L225 Difference]: With dead ends: 19904 [2018-01-30 01:46:23,390 INFO L226 Difference]: Without dead ends: 11658 [2018-01-30 01:46:23,398 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 01:46:23,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11658 states. [2018-01-30 01:46:23,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11658 to 11658. [2018-01-30 01:46:23,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11658 states. [2018-01-30 01:46:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11658 states to 11658 states and 13823 transitions. [2018-01-30 01:46:23,534 INFO L78 Accepts]: Start accepts. Automaton has 11658 states and 13823 transitions. Word has length 353 [2018-01-30 01:46:23,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:23,534 INFO L432 AbstractCegarLoop]: Abstraction has 11658 states and 13823 transitions. [2018-01-30 01:46:23,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:23,534 INFO L276 IsEmpty]: Start isEmpty. Operand 11658 states and 13823 transitions. [2018-01-30 01:46:23,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-01-30 01:46:23,543 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:23,543 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:23,543 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:23,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1043880983, now seen corresponding path program 1 times [2018-01-30 01:46:23,544 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:23,544 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:23,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:23,544 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:23,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:23,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-01-30 01:46:23,669 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:23,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:23,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:23,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:23,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:23,669 INFO L87 Difference]: Start difference. First operand 11658 states and 13823 transitions. Second operand 3 states. [2018-01-30 01:46:23,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:23,755 INFO L93 Difference]: Finished difference Result 17472 states and 20659 transitions. [2018-01-30 01:46:23,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:23,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 389 [2018-01-30 01:46:23,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:23,767 INFO L225 Difference]: With dead ends: 17472 [2018-01-30 01:46:23,767 INFO L226 Difference]: Without dead ends: 12164 [2018-01-30 01:46:23,774 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 01:46:23,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12164 states. [2018-01-30 01:46:23,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12164 to 12162. [2018-01-30 01:46:23,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12162 states. [2018-01-30 01:46:23,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12162 states to 12162 states and 14320 transitions. [2018-01-30 01:46:23,872 INFO L78 Accepts]: Start accepts. Automaton has 12162 states and 14320 transitions. Word has length 389 [2018-01-30 01:46:23,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:23,872 INFO L432 AbstractCegarLoop]: Abstraction has 12162 states and 14320 transitions. [2018-01-30 01:46:23,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:23,873 INFO L276 IsEmpty]: Start isEmpty. Operand 12162 states and 14320 transitions. [2018-01-30 01:46:23,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-01-30 01:46:23,942 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:23,942 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:23,942 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:23,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1797533763, now seen corresponding path program 1 times [2018-01-30 01:46:23,942 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:23,942 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:23,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:23,943 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:23,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:23,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:24,077 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-01-30 01:46:24,078 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:24,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:24,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:24,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:24,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:24,078 INFO L87 Difference]: Start difference. First operand 12162 states and 14320 transitions. Second operand 3 states. [2018-01-30 01:46:24,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:24,241 INFO L93 Difference]: Finished difference Result 20717 states and 24336 transitions. [2018-01-30 01:46:24,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:24,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2018-01-30 01:46:24,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:24,252 INFO L225 Difference]: With dead ends: 20717 [2018-01-30 01:46:24,252 INFO L226 Difference]: Without dead ends: 14996 [2018-01-30 01:46:24,259 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 01:46:24,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14996 states. [2018-01-30 01:46:24,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14996 to 14994. [2018-01-30 01:46:24,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14994 states. [2018-01-30 01:46:24,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14994 states to 14994 states and 17598 transitions. [2018-01-30 01:46:24,379 INFO L78 Accepts]: Start accepts. Automaton has 14994 states and 17598 transitions. Word has length 392 [2018-01-30 01:46:24,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:24,380 INFO L432 AbstractCegarLoop]: Abstraction has 14994 states and 17598 transitions. [2018-01-30 01:46:24,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:24,380 INFO L276 IsEmpty]: Start isEmpty. Operand 14994 states and 17598 transitions. [2018-01-30 01:46:24,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-01-30 01:46:24,389 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:24,389 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:24,389 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:24,390 INFO L82 PathProgramCache]: Analyzing trace with hash -135190855, now seen corresponding path program 1 times [2018-01-30 01:46:24,390 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:24,390 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:24,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:24,390 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:24,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:24,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:24,570 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-01-30 01:46:24,570 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:24,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:24,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:24,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:24,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:24,571 INFO L87 Difference]: Start difference. First operand 14994 states and 17598 transitions. Second operand 3 states. [2018-01-30 01:46:25,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:25,096 INFO L93 Difference]: Finished difference Result 30013 states and 35456 transitions. [2018-01-30 01:46:25,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:25,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2018-01-30 01:46:25,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:25,107 INFO L225 Difference]: With dead ends: 30013 [2018-01-30 01:46:25,107 INFO L226 Difference]: Without dead ends: 16004 [2018-01-30 01:46:25,117 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 01:46:25,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16004 states. [2018-01-30 01:46:25,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16004 to 15669. [2018-01-30 01:46:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15669 states. [2018-01-30 01:46:25,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15669 states to 15669 states and 18298 transitions. [2018-01-30 01:46:25,245 INFO L78 Accepts]: Start accepts. Automaton has 15669 states and 18298 transitions. Word has length 393 [2018-01-30 01:46:25,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:25,246 INFO L432 AbstractCegarLoop]: Abstraction has 15669 states and 18298 transitions. [2018-01-30 01:46:25,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:25,246 INFO L276 IsEmpty]: Start isEmpty. Operand 15669 states and 18298 transitions. [2018-01-30 01:46:25,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-01-30 01:46:25,255 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:25,255 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:25,256 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:25,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1845744006, now seen corresponding path program 2 times [2018-01-30 01:46:25,256 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:25,256 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:25,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:25,256 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:25,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:25,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:25,475 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-01-30 01:46:25,475 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:25,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:25,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:25,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:25,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:25,476 INFO L87 Difference]: Start difference. First operand 15669 states and 18298 transitions. Second operand 3 states. [2018-01-30 01:46:25,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:25,903 INFO L93 Difference]: Finished difference Result 30343 states and 35489 transitions. [2018-01-30 01:46:25,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:25,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 396 [2018-01-30 01:46:25,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:25,914 INFO L225 Difference]: With dead ends: 30343 [2018-01-30 01:46:25,914 INFO L226 Difference]: Without dead ends: 17750 [2018-01-30 01:46:25,925 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 01:46:25,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17750 states. [2018-01-30 01:46:26,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17750 to 17750. [2018-01-30 01:46:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17750 states. [2018-01-30 01:46:26,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17750 states to 17750 states and 20728 transitions. [2018-01-30 01:46:26,063 INFO L78 Accepts]: Start accepts. Automaton has 17750 states and 20728 transitions. Word has length 396 [2018-01-30 01:46:26,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:26,063 INFO L432 AbstractCegarLoop]: Abstraction has 17750 states and 20728 transitions. [2018-01-30 01:46:26,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:26,063 INFO L276 IsEmpty]: Start isEmpty. Operand 17750 states and 20728 transitions. [2018-01-30 01:46:26,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-01-30 01:46:26,073 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:26,073 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:26,073 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:26,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1632883671, now seen corresponding path program 1 times [2018-01-30 01:46:26,074 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:26,074 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:26,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:26,074 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:46:26,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:26,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:26,185 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-01-30 01:46:26,185 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:26,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:26,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:26,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:26,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:26,186 INFO L87 Difference]: Start difference. First operand 17750 states and 20728 transitions. Second operand 3 states. [2018-01-30 01:46:26,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:26,427 INFO L93 Difference]: Finished difference Result 36114 states and 42886 transitions. [2018-01-30 01:46:26,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:26,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 400 [2018-01-30 01:46:26,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:26,439 INFO L225 Difference]: With dead ends: 36114 [2018-01-30 01:46:26,439 INFO L226 Difference]: Without dead ends: 19359 [2018-01-30 01:46:26,452 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 01:46:26,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19359 states. [2018-01-30 01:46:26,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19359 to 19080. [2018-01-30 01:46:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19080 states. [2018-01-30 01:46:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19080 states to 19080 states and 22086 transitions. [2018-01-30 01:46:26,593 INFO L78 Accepts]: Start accepts. Automaton has 19080 states and 22086 transitions. Word has length 400 [2018-01-30 01:46:26,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:26,594 INFO L432 AbstractCegarLoop]: Abstraction has 19080 states and 22086 transitions. [2018-01-30 01:46:26,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:26,594 INFO L276 IsEmpty]: Start isEmpty. Operand 19080 states and 22086 transitions. [2018-01-30 01:46:26,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2018-01-30 01:46:26,603 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:26,604 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:26,604 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:26,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1678509212, now seen corresponding path program 2 times [2018-01-30 01:46:26,604 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:26,604 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:26,605 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:26,605 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:26,605 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:26,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-01-30 01:46:26,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:26,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:26,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:26,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:26,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:26,728 INFO L87 Difference]: Start difference. First operand 19080 states and 22086 transitions. Second operand 3 states. [2018-01-30 01:46:27,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:27,179 INFO L93 Difference]: Finished difference Result 37155 states and 43051 transitions. [2018-01-30 01:46:27,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:27,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 403 [2018-01-30 01:46:27,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:27,247 INFO L225 Difference]: With dead ends: 37155 [2018-01-30 01:46:27,248 INFO L226 Difference]: Without dead ends: 21326 [2018-01-30 01:46:27,253 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 01:46:27,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21326 states. [2018-01-30 01:46:27,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21326 to 21326. [2018-01-30 01:46:27,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21326 states. [2018-01-30 01:46:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21326 states to 21326 states and 24689 transitions. [2018-01-30 01:46:27,397 INFO L78 Accepts]: Start accepts. Automaton has 21326 states and 24689 transitions. Word has length 403 [2018-01-30 01:46:27,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:27,398 INFO L432 AbstractCegarLoop]: Abstraction has 21326 states and 24689 transitions. [2018-01-30 01:46:27,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:27,398 INFO L276 IsEmpty]: Start isEmpty. Operand 21326 states and 24689 transitions. [2018-01-30 01:46:27,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-01-30 01:46:27,408 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:27,408 INFO L350 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:27,408 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:27,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1568337668, now seen corresponding path program 1 times [2018-01-30 01:46:27,408 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:27,408 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:27,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:27,409 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:46:27,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:27,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:27,532 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2018-01-30 01:46:27,532 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:27,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:27,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:27,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:27,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:27,533 INFO L87 Difference]: Start difference. First operand 21326 states and 24689 transitions. Second operand 3 states. [2018-01-30 01:46:27,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:27,737 INFO L93 Difference]: Finished difference Result 43543 states and 51299 transitions. [2018-01-30 01:46:27,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:27,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 440 [2018-01-30 01:46:27,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:27,753 INFO L225 Difference]: With dead ends: 43543 [2018-01-30 01:46:27,753 INFO L226 Difference]: Without dead ends: 23222 [2018-01-30 01:46:27,766 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 01:46:27,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23222 states. [2018-01-30 01:46:27,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23222 to 22911. [2018-01-30 01:46:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22911 states. [2018-01-30 01:46:27,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22911 states to 22911 states and 26305 transitions. [2018-01-30 01:46:27,939 INFO L78 Accepts]: Start accepts. Automaton has 22911 states and 26305 transitions. Word has length 440 [2018-01-30 01:46:27,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:27,940 INFO L432 AbstractCegarLoop]: Abstraction has 22911 states and 26305 transitions. [2018-01-30 01:46:27,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:27,940 INFO L276 IsEmpty]: Start isEmpty. Operand 22911 states and 26305 transitions. [2018-01-30 01:46:28,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-01-30 01:46:28,024 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:28,024 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 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] [2018-01-30 01:46:28,024 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:28,025 INFO L82 PathProgramCache]: Analyzing trace with hash 299367808, now seen corresponding path program 1 times [2018-01-30 01:46:28,025 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:28,025 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:28,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:28,025 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:28,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:28,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:28,150 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2018-01-30 01:46:28,151 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:28,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:28,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:28,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:28,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:28,151 INFO L87 Difference]: Start difference. First operand 22911 states and 26305 transitions. Second operand 3 states. [2018-01-30 01:46:28,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:28,690 INFO L93 Difference]: Finished difference Result 44807 states and 51475 transitions. [2018-01-30 01:46:28,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:28,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 445 [2018-01-30 01:46:28,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:28,708 INFO L225 Difference]: With dead ends: 44807 [2018-01-30 01:46:28,708 INFO L226 Difference]: Without dead ends: 25332 [2018-01-30 01:46:28,723 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 01:46:28,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25332 states. [2018-01-30 01:46:28,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25332 to 25332. [2018-01-30 01:46:28,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25332 states. [2018-01-30 01:46:28,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25332 states to 25332 states and 29091 transitions. [2018-01-30 01:46:28,912 INFO L78 Accepts]: Start accepts. Automaton has 25332 states and 29091 transitions. Word has length 445 [2018-01-30 01:46:28,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:28,912 INFO L432 AbstractCegarLoop]: Abstraction has 25332 states and 29091 transitions. [2018-01-30 01:46:28,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:28,912 INFO L276 IsEmpty]: Start isEmpty. Operand 25332 states and 29091 transitions. [2018-01-30 01:46:28,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2018-01-30 01:46:28,924 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:28,924 INFO L350 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:28,924 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:28,924 INFO L82 PathProgramCache]: Analyzing trace with hash 8127755, now seen corresponding path program 1 times [2018-01-30 01:46:28,924 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:28,924 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:28,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:28,925 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:28,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:28,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2018-01-30 01:46:29,447 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:29,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:29,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:29,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:29,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:29,448 INFO L87 Difference]: Start difference. First operand 25332 states and 29091 transitions. Second operand 3 states. [2018-01-30 01:46:29,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:29,696 INFO L93 Difference]: Finished difference Result 49599 states and 56972 transitions. [2018-01-30 01:46:29,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:29,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 480 [2018-01-30 01:46:29,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:29,714 INFO L225 Difference]: With dead ends: 49599 [2018-01-30 01:46:29,714 INFO L226 Difference]: Without dead ends: 27703 [2018-01-30 01:46:29,730 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 01:46:29,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27703 states. [2018-01-30 01:46:29,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27703 to 27703. [2018-01-30 01:46:29,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27703 states. [2018-01-30 01:46:29,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27703 states to 27703 states and 31777 transitions. [2018-01-30 01:46:29,935 INFO L78 Accepts]: Start accepts. Automaton has 27703 states and 31777 transitions. Word has length 480 [2018-01-30 01:46:29,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:29,935 INFO L432 AbstractCegarLoop]: Abstraction has 27703 states and 31777 transitions. [2018-01-30 01:46:29,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:29,935 INFO L276 IsEmpty]: Start isEmpty. Operand 27703 states and 31777 transitions. [2018-01-30 01:46:29,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2018-01-30 01:46:29,949 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:29,950 INFO L350 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 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] [2018-01-30 01:46:29,950 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:29,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1086280738, now seen corresponding path program 1 times [2018-01-30 01:46:29,950 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:29,950 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:29,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:29,951 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:29,951 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:29,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:30,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1149 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2018-01-30 01:46:30,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:30,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:30,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:30,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:30,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:30,132 INFO L87 Difference]: Start difference. First operand 27703 states and 31777 transitions. Second operand 3 states. [2018-01-30 01:46:30,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:30,548 INFO L93 Difference]: Finished difference Result 79362 states and 91109 transitions. [2018-01-30 01:46:30,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:30,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 523 [2018-01-30 01:46:30,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:30,584 INFO L225 Difference]: With dead ends: 79362 [2018-01-30 01:46:30,585 INFO L226 Difference]: Without dead ends: 52674 [2018-01-30 01:46:30,607 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 01:46:30,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52674 states. [2018-01-30 01:46:30,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52674 to 52672. [2018-01-30 01:46:30,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52672 states. [2018-01-30 01:46:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52672 states to 52672 states and 60411 transitions. [2018-01-30 01:46:31,017 INFO L78 Accepts]: Start accepts. Automaton has 52672 states and 60411 transitions. Word has length 523 [2018-01-30 01:46:31,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:31,017 INFO L432 AbstractCegarLoop]: Abstraction has 52672 states and 60411 transitions. [2018-01-30 01:46:31,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:31,017 INFO L276 IsEmpty]: Start isEmpty. Operand 52672 states and 60411 transitions. [2018-01-30 01:46:31,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2018-01-30 01:46:31,044 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:31,044 INFO L350 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:31,044 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:31,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1028456512, now seen corresponding path program 1 times [2018-01-30 01:46:31,044 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:31,044 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:31,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:31,045 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:31,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:31,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:31,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-01-30 01:46:31,305 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:31,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:31,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:31,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:31,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:31,306 INFO L87 Difference]: Start difference. First operand 52672 states and 60411 transitions. Second operand 3 states. [2018-01-30 01:46:31,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:31,781 INFO L93 Difference]: Finished difference Result 104306 states and 119761 transitions. [2018-01-30 01:46:31,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:31,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 536 [2018-01-30 01:46:31,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:31,819 INFO L225 Difference]: With dead ends: 104306 [2018-01-30 01:46:31,819 INFO L226 Difference]: Without dead ends: 57354 [2018-01-30 01:46:31,852 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 01:46:31,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57354 states. [2018-01-30 01:46:32,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57354 to 57354. [2018-01-30 01:46:32,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57354 states. [2018-01-30 01:46:32,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57354 states to 57354 states and 65825 transitions. [2018-01-30 01:46:32,294 INFO L78 Accepts]: Start accepts. Automaton has 57354 states and 65825 transitions. Word has length 536 [2018-01-30 01:46:32,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:32,295 INFO L432 AbstractCegarLoop]: Abstraction has 57354 states and 65825 transitions. [2018-01-30 01:46:32,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:32,295 INFO L276 IsEmpty]: Start isEmpty. Operand 57354 states and 65825 transitions. [2018-01-30 01:46:32,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2018-01-30 01:46:32,331 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:32,331 INFO L350 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:32,331 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:32,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1724934260, now seen corresponding path program 1 times [2018-01-30 01:46:32,332 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:32,332 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:32,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:32,332 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:32,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:32,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:33,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1355 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2018-01-30 01:46:33,202 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:33,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:33,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:33,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:33,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:33,203 INFO L87 Difference]: Start difference. First operand 57354 states and 65825 transitions. Second operand 3 states. [2018-01-30 01:46:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:33,801 INFO L93 Difference]: Finished difference Result 113670 states and 130589 transitions. [2018-01-30 01:46:33,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:33,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 587 [2018-01-30 01:46:33,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:33,841 INFO L225 Difference]: With dead ends: 113670 [2018-01-30 01:46:33,841 INFO L226 Difference]: Without dead ends: 62036 [2018-01-30 01:46:33,878 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 01:46:33,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62036 states. [2018-01-30 01:46:34,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62036 to 62036. [2018-01-30 01:46:34,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62036 states. [2018-01-30 01:46:34,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62036 states to 62036 states and 71249 transitions. [2018-01-30 01:46:34,359 INFO L78 Accepts]: Start accepts. Automaton has 62036 states and 71249 transitions. Word has length 587 [2018-01-30 01:46:34,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:34,359 INFO L432 AbstractCegarLoop]: Abstraction has 62036 states and 71249 transitions. [2018-01-30 01:46:34,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:34,359 INFO L276 IsEmpty]: Start isEmpty. Operand 62036 states and 71249 transitions. [2018-01-30 01:46:34,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-01-30 01:46:34,394 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:34,394 INFO L350 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:34,394 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:34,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1329931931, now seen corresponding path program 1 times [2018-01-30 01:46:34,394 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:34,394 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:34,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:34,395 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:34,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:34,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 331 proven. 0 refuted. 0 times theorem prover too weak. 1350 trivial. 0 not checked. [2018-01-30 01:46:34,672 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:34,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:34,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:34,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:34,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:34,673 INFO L87 Difference]: Start difference. First operand 62036 states and 71249 transitions. Second operand 3 states. [2018-01-30 01:46:35,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:35,351 INFO L93 Difference]: Finished difference Result 122964 states and 141332 transitions. [2018-01-30 01:46:35,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:35,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 639 [2018-01-30 01:46:35,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:35,394 INFO L225 Difference]: With dead ends: 122964 [2018-01-30 01:46:35,394 INFO L226 Difference]: Without dead ends: 66648 [2018-01-30 01:46:35,433 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 01:46:35,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66648 states. [2018-01-30 01:46:37,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66648 to 66648. [2018-01-30 01:46:37,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66648 states. [2018-01-30 01:46:37,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66648 states to 66648 states and 76478 transitions. [2018-01-30 01:46:37,150 INFO L78 Accepts]: Start accepts. Automaton has 66648 states and 76478 transitions. Word has length 639 [2018-01-30 01:46:37,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:37,150 INFO L432 AbstractCegarLoop]: Abstraction has 66648 states and 76478 transitions. [2018-01-30 01:46:37,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:37,151 INFO L276 IsEmpty]: Start isEmpty. Operand 66648 states and 76478 transitions. [2018-01-30 01:46:37,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2018-01-30 01:46:37,189 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:37,189 INFO L350 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:37,189 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:37,189 INFO L82 PathProgramCache]: Analyzing trace with hash -571833953, now seen corresponding path program 1 times [2018-01-30 01:46:37,189 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:37,190 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:37,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:37,190 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:37,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:37,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:37,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2062 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2018-01-30 01:46:37,400 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:37,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:37,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:37,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:37,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:37,401 INFO L87 Difference]: Start difference. First operand 66648 states and 76478 transitions. Second operand 3 states. [2018-01-30 01:46:38,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:38,129 INFO L93 Difference]: Finished difference Result 132258 states and 151895 transitions. [2018-01-30 01:46:38,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:38,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 690 [2018-01-30 01:46:38,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:38,176 INFO L225 Difference]: With dead ends: 132258 [2018-01-30 01:46:38,176 INFO L226 Difference]: Without dead ends: 71330 [2018-01-30 01:46:38,217 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 01:46:38,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71330 states. [2018-01-30 01:46:38,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71330 to 71330. [2018-01-30 01:46:38,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71330 states. [2018-01-30 01:46:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71330 states to 71330 states and 81922 transitions. [2018-01-30 01:46:38,916 INFO L78 Accepts]: Start accepts. Automaton has 71330 states and 81922 transitions. Word has length 690 [2018-01-30 01:46:38,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:38,917 INFO L432 AbstractCegarLoop]: Abstraction has 71330 states and 81922 transitions. [2018-01-30 01:46:38,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 71330 states and 81922 transitions. [2018-01-30 01:46:38,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 743 [2018-01-30 01:46:38,954 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:38,954 INFO L350 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:38,954 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:38,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1278301670, now seen corresponding path program 1 times [2018-01-30 01:46:38,954 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:38,954 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:38,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:38,955 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:38,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:38,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 419 proven. 0 refuted. 0 times theorem prover too weak. 2057 trivial. 0 not checked. [2018-01-30 01:46:39,195 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:39,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:39,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:39,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:39,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:39,196 INFO L87 Difference]: Start difference. First operand 71330 states and 81922 transitions. Second operand 3 states. [2018-01-30 01:46:39,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:39,983 INFO L93 Difference]: Finished difference Result 141622 states and 162783 transitions. [2018-01-30 01:46:39,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:39,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 742 [2018-01-30 01:46:39,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:40,032 INFO L225 Difference]: With dead ends: 141622 [2018-01-30 01:46:40,032 INFO L226 Difference]: Without dead ends: 76012 [2018-01-30 01:46:40,068 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 01:46:40,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76012 states. [2018-01-30 01:46:40,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76012 to 76012. [2018-01-30 01:46:40,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76012 states. [2018-01-30 01:46:40,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76012 states to 76012 states and 87376 transitions. [2018-01-30 01:46:40,652 INFO L78 Accepts]: Start accepts. Automaton has 76012 states and 87376 transitions. Word has length 742 [2018-01-30 01:46:40,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:40,653 INFO L432 AbstractCegarLoop]: Abstraction has 76012 states and 87376 transitions. [2018-01-30 01:46:40,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:40,653 INFO L276 IsEmpty]: Start isEmpty. Operand 76012 states and 87376 transitions. [2018-01-30 01:46:40,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2018-01-30 01:46:40,697 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:40,697 INFO L350 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:40,697 INFO L371 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:40,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1001729540, now seen corresponding path program 1 times [2018-01-30 01:46:40,697 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:40,697 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:40,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:40,698 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:40,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:40,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:41,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2931 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 2473 trivial. 0 not checked. [2018-01-30 01:46:41,144 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:41,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:41,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:41,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:41,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:41,145 INFO L87 Difference]: Start difference. First operand 76012 states and 87376 transitions. Second operand 3 states. [2018-01-30 01:46:41,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:41,783 INFO L93 Difference]: Finished difference Result 150926 states and 173606 transitions. [2018-01-30 01:46:41,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:41,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 795 [2018-01-30 01:46:41,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:41,835 INFO L225 Difference]: With dead ends: 150926 [2018-01-30 01:46:41,835 INFO L226 Difference]: Without dead ends: 80634 [2018-01-30 01:46:41,882 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 01:46:41,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80634 states. [2018-01-30 01:46:42,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80634 to 80634. [2018-01-30 01:46:42,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80634 states. [2018-01-30 01:46:42,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80634 states to 80634 states and 92615 transitions. [2018-01-30 01:46:42,514 INFO L78 Accepts]: Start accepts. Automaton has 80634 states and 92615 transitions. Word has length 795 [2018-01-30 01:46:42,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:42,514 INFO L432 AbstractCegarLoop]: Abstraction has 80634 states and 92615 transitions. [2018-01-30 01:46:42,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:42,514 INFO L276 IsEmpty]: Start isEmpty. Operand 80634 states and 92615 transitions. [2018-01-30 01:46:42,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2018-01-30 01:46:42,557 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:42,557 INFO L350 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:42,558 INFO L371 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:42,558 INFO L82 PathProgramCache]: Analyzing trace with hash 484267192, now seen corresponding path program 1 times [2018-01-30 01:46:42,558 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:42,558 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:42,558 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:42,558 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:42,558 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:42,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:43,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3439 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 2931 trivial. 0 not checked. [2018-01-30 01:46:43,865 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:43,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:43,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:43,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:43,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:43,866 INFO L87 Difference]: Start difference. First operand 80634 states and 92615 transitions. Second operand 3 states. [2018-01-30 01:46:44,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:44,553 INFO L93 Difference]: Finished difference Result 160230 states and 184169 transitions. [2018-01-30 01:46:44,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:44,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 847 [2018-01-30 01:46:44,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:44,602 INFO L225 Difference]: With dead ends: 160230 [2018-01-30 01:46:44,602 INFO L226 Difference]: Without dead ends: 85316 [2018-01-30 01:46:44,632 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 01:46:44,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85316 states. [2018-01-30 01:46:45,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85316 to 85316. [2018-01-30 01:46:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85316 states. [2018-01-30 01:46:45,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85316 states to 85316 states and 98089 transitions. [2018-01-30 01:46:45,279 INFO L78 Accepts]: Start accepts. Automaton has 85316 states and 98089 transitions. Word has length 847 [2018-01-30 01:46:45,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:45,280 INFO L432 AbstractCegarLoop]: Abstraction has 85316 states and 98089 transitions. [2018-01-30 01:46:45,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:45,280 INFO L276 IsEmpty]: Start isEmpty. Operand 85316 states and 98089 transitions. [2018-01-30 01:46:45,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2018-01-30 01:46:45,324 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:45,324 INFO L350 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:45,324 INFO L371 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:45,325 INFO L82 PathProgramCache]: Analyzing trace with hash 295921378, now seen corresponding path program 1 times [2018-01-30 01:46:45,325 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:45,325 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:45,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:45,325 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:45,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:45,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:45,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3982 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 3436 trivial. 0 not checked. [2018-01-30 01:46:45,744 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:45,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:45,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:45,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:45,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:45,745 INFO L87 Difference]: Start difference. First operand 85316 states and 98089 transitions. Second operand 3 states. [2018-01-30 01:46:46,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:46,398 INFO L93 Difference]: Finished difference Result 169594 states and 195117 transitions. [2018-01-30 01:46:46,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:46,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 900 [2018-01-30 01:46:46,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:46,458 INFO L225 Difference]: With dead ends: 169594 [2018-01-30 01:46:46,458 INFO L226 Difference]: Without dead ends: 89998 [2018-01-30 01:46:46,511 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 01:46:46,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89998 states. [2018-01-30 01:46:47,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89998 to 89998. [2018-01-30 01:46:47,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89998 states. [2018-01-30 01:46:47,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89998 states to 89998 states and 103573 transitions. [2018-01-30 01:46:47,405 INFO L78 Accepts]: Start accepts. Automaton has 89998 states and 103573 transitions. Word has length 900 [2018-01-30 01:46:47,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:47,406 INFO L432 AbstractCegarLoop]: Abstraction has 89998 states and 103573 transitions. [2018-01-30 01:46:47,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:47,406 INFO L276 IsEmpty]: Start isEmpty. Operand 89998 states and 103573 transitions. [2018-01-30 01:46:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 955 [2018-01-30 01:46:47,456 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:47,456 INFO L350 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 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, 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, 1, 1, 1] [2018-01-30 01:46:47,457 INFO L371 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:47,457 INFO L82 PathProgramCache]: Analyzing trace with hash -627721683, now seen corresponding path program 1 times [2018-01-30 01:46:47,457 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:47,457 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:47,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:47,457 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:47,458 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:47,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:47,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4567 backedges. 586 proven. 0 refuted. 0 times theorem prover too weak. 3981 trivial. 0 not checked. [2018-01-30 01:46:47,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:47,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:47,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:47,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:47,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:47,902 INFO L87 Difference]: Start difference. First operand 89998 states and 103573 transitions. Second operand 3 states. [2018-01-30 01:46:48,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:48,548 INFO L93 Difference]: Finished difference Result 178908 states and 206020 transitions. [2018-01-30 01:46:48,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:48,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 954 [2018-01-30 01:46:48,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:48,610 INFO L225 Difference]: With dead ends: 178908 [2018-01-30 01:46:48,610 INFO L226 Difference]: Without dead ends: 94630 [2018-01-30 01:46:48,665 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 01:46:48,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94630 states. [2018-01-30 01:46:50,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94630 to 94630. [2018-01-30 01:46:50,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94630 states. [2018-01-30 01:46:50,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94630 states to 94630 states and 108822 transitions. [2018-01-30 01:46:50,739 INFO L78 Accepts]: Start accepts. Automaton has 94630 states and 108822 transitions. Word has length 954 [2018-01-30 01:46:50,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:50,740 INFO L432 AbstractCegarLoop]: Abstraction has 94630 states and 108822 transitions. [2018-01-30 01:46:50,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:50,740 INFO L276 IsEmpty]: Start isEmpty. Operand 94630 states and 108822 transitions. [2018-01-30 01:46:50,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1008 [2018-01-30 01:46:50,793 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:50,793 INFO L350 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 11, 11, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1] [2018-01-30 01:46:50,794 INFO L371 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:50,794 INFO L82 PathProgramCache]: Analyzing trace with hash -23753315, now seen corresponding path program 1 times [2018-01-30 01:46:50,794 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:50,794 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:50,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:50,794 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:50,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:50,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5203 backedges. 636 proven. 0 refuted. 0 times theorem prover too weak. 4567 trivial. 0 not checked. [2018-01-30 01:46:51,288 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:51,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:51,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:51,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:51,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:51,289 INFO L87 Difference]: Start difference. First operand 94630 states and 108822 transitions. Second operand 3 states. [2018-01-30 01:46:51,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:51,982 INFO L93 Difference]: Finished difference Result 188222 states and 216583 transitions. [2018-01-30 01:46:51,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:51,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1007 [2018-01-30 01:46:51,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:52,048 INFO L225 Difference]: With dead ends: 188222 [2018-01-30 01:46:52,048 INFO L226 Difference]: Without dead ends: 99312 [2018-01-30 01:46:52,104 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 01:46:52,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99312 states. [2018-01-30 01:46:53,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99312 to 99312. [2018-01-30 01:46:53,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99312 states. [2018-01-30 01:46:53,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99312 states to 99312 states and 114326 transitions. [2018-01-30 01:46:53,144 INFO L78 Accepts]: Start accepts. Automaton has 99312 states and 114326 transitions. Word has length 1007 [2018-01-30 01:46:53,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:53,144 INFO L432 AbstractCegarLoop]: Abstraction has 99312 states and 114326 transitions. [2018-01-30 01:46:53,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:53,144 INFO L276 IsEmpty]: Start isEmpty. Operand 99312 states and 114326 transitions. [2018-01-30 01:46:53,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1062 [2018-01-30 01:46:53,199 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:53,199 INFO L350 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 17, 17, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 7, 7, 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, 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, 1, 1, 1, 1, 1, 1] [2018-01-30 01:46:53,199 INFO L371 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:53,200 INFO L82 PathProgramCache]: Analyzing trace with hash -824945858, now seen corresponding path program 1 times [2018-01-30 01:46:53,200 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:53,200 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:53,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:53,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:53,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:53,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:53,719 INFO L134 CoverageAnalysis]: Checked inductivity of 5876 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2018-01-30 01:46:53,720 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:53,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:46:53,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:46:53,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:46:53,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:46:53,720 INFO L87 Difference]: Start difference. First operand 99312 states and 114326 transitions. Second operand 3 states. [2018-01-30 01:46:54,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:54,291 INFO L93 Difference]: Finished difference Result 103996 states and 119851 transitions. [2018-01-30 01:46:54,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:46:54,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1061 [2018-01-30 01:46:54,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:54,359 INFO L225 Difference]: With dead ends: 103996 [2018-01-30 01:46:54,360 INFO L226 Difference]: Without dead ends: 103994 [2018-01-30 01:46:54,380 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 01:46:54,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103994 states. [2018-01-30 01:46:56,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103994 to 103994. [2018-01-30 01:46:56,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103994 states. [2018-01-30 01:46:56,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103994 states to 103994 states and 119840 transitions. [2018-01-30 01:46:56,296 INFO L78 Accepts]: Start accepts. Automaton has 103994 states and 119840 transitions. Word has length 1061 [2018-01-30 01:46:56,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:56,297 INFO L432 AbstractCegarLoop]: Abstraction has 103994 states and 119840 transitions. [2018-01-30 01:46:56,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:46:56,297 INFO L276 IsEmpty]: Start isEmpty. Operand 103994 states and 119840 transitions. [2018-01-30 01:46:56,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1117 [2018-01-30 01:46:56,352 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:56,353 INFO L350 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:56,353 INFO L371 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:56,353 INFO L82 PathProgramCache]: Analyzing trace with hash -698954062, now seen corresponding path program 1 times [2018-01-30 01:46:56,353 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:56,353 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:56,354 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:56,354 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:56,354 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:56,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:46:57,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6592 backedges. 335 proven. 0 refuted. 0 times theorem prover too weak. 6257 trivial. 0 not checked. [2018-01-30 01:46:57,065 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:46:57,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:46:57,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:46:57,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:46:57,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:46:57,066 INFO L87 Difference]: Start difference. First operand 103994 states and 119840 transitions. Second operand 5 states. [2018-01-30 01:46:57,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:46:57,996 INFO L93 Difference]: Finished difference Result 139386 states and 160022 transitions. [2018-01-30 01:46:57,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:46:57,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1116 [2018-01-30 01:46:57,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:46:58,067 INFO L225 Difference]: With dead ends: 139386 [2018-01-30 01:46:58,067 INFO L226 Difference]: Without dead ends: 116140 [2018-01-30 01:46:58,093 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:46:58,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116140 states. [2018-01-30 01:46:58,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116140 to 104834. [2018-01-30 01:46:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104834 states. [2018-01-30 01:46:59,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104834 states to 104834 states and 120768 transitions. [2018-01-30 01:46:59,054 INFO L78 Accepts]: Start accepts. Automaton has 104834 states and 120768 transitions. Word has length 1116 [2018-01-30 01:46:59,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:46:59,054 INFO L432 AbstractCegarLoop]: Abstraction has 104834 states and 120768 transitions. [2018-01-30 01:46:59,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:46:59,054 INFO L276 IsEmpty]: Start isEmpty. Operand 104834 states and 120768 transitions. [2018-01-30 01:46:59,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1118 [2018-01-30 01:46:59,302 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:46:59,302 INFO L350 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:59,302 INFO L371 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:46:59,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1649795293, now seen corresponding path program 1 times [2018-01-30 01:46:59,303 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:46:59,303 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:46:59,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:59,303 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:46:59,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:46:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:46:59,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:47:00,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 6352 trivial. 0 not checked. [2018-01-30 01:47:00,978 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:47:00,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 01:47:00,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:47:00,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:47:00,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:47:00,979 INFO L87 Difference]: Start difference. First operand 104834 states and 120768 transitions. Second operand 6 states. [2018-01-30 01:47:02,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:47:02,082 INFO L93 Difference]: Finished difference Result 222489 states and 262066 transitions. [2018-01-30 01:47:02,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:47:02,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1117 [2018-01-30 01:47:02,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:47:02,162 INFO L225 Difference]: With dead ends: 222489 [2018-01-30 01:47:02,162 INFO L226 Difference]: Without dead ends: 115241 [2018-01-30 01:47:02,205 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-30 01:47:02,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115241 states. [2018-01-30 01:47:03,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115241 to 110525. [2018-01-30 01:47:03,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110525 states. [2018-01-30 01:47:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110525 states to 110525 states and 127263 transitions. [2018-01-30 01:47:03,238 INFO L78 Accepts]: Start accepts. Automaton has 110525 states and 127263 transitions. Word has length 1117 [2018-01-30 01:47:03,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:47:03,238 INFO L432 AbstractCegarLoop]: Abstraction has 110525 states and 127263 transitions. [2018-01-30 01:47:03,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:47:03,239 INFO L276 IsEmpty]: Start isEmpty. Operand 110525 states and 127263 transitions. [2018-01-30 01:47:03,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1120 [2018-01-30 01:47:03,304 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:47:03,304 INFO L350 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 14, 13, 13, 8, 8, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:47:03,304 INFO L371 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:47:03,305 INFO L82 PathProgramCache]: Analyzing trace with hash -916590323, now seen corresponding path program 2 times [2018-01-30 01:47:03,305 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:47:03,305 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:47:03,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:47:03,305 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:47:03,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:47:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:47:03,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:47:04,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6607 backedges. 741 proven. 0 refuted. 0 times theorem prover too weak. 5866 trivial. 0 not checked. [2018-01-30 01:47:04,081 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:47:04,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:47:04,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:47:04,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:47:04,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:47:04,081 INFO L87 Difference]: Start difference. First operand 110525 states and 127263 transitions. Second operand 5 states. [2018-01-30 01:47:04,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:47:04,963 INFO L93 Difference]: Finished difference Result 134097 states and 153703 transitions. [2018-01-30 01:47:04,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:47:04,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1119 [2018-01-30 01:47:04,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:47:05,044 INFO L225 Difference]: With dead ends: 134097 [2018-01-30 01:47:05,044 INFO L226 Difference]: Without dead ends: 120965 [2018-01-30 01:47:05,072 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:47:05,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120965 states. [2018-01-30 01:47:06,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120965 to 110835. [2018-01-30 01:47:06,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110835 states. [2018-01-30 01:47:06,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110835 states to 110835 states and 127629 transitions. [2018-01-30 01:47:06,385 INFO L78 Accepts]: Start accepts. Automaton has 110835 states and 127629 transitions. Word has length 1119 [2018-01-30 01:47:06,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:47:06,385 INFO L432 AbstractCegarLoop]: Abstraction has 110835 states and 127629 transitions. [2018-01-30 01:47:06,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:47:06,385 INFO L276 IsEmpty]: Start isEmpty. Operand 110835 states and 127629 transitions. [2018-01-30 01:47:06,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1121 [2018-01-30 01:47:06,444 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:47:06,445 INFO L350 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 14, 13, 13, 8, 8, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:47:06,445 INFO L371 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:47:06,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1293493643, now seen corresponding path program 1 times [2018-01-30 01:47:06,445 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:47:06,445 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:47:06,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:47:06,446 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:47:06,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:47:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:47:06,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:47:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6626 backedges. 673 proven. 0 refuted. 0 times theorem prover too weak. 5953 trivial. 0 not checked. [2018-01-30 01:47:08,451 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:47:08,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:47:08,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:47:08,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:47:08,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:47:08,452 INFO L87 Difference]: Start difference. First operand 110835 states and 127629 transitions. Second operand 4 states. [2018-01-30 01:47:09,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:47:09,869 INFO L93 Difference]: Finished difference Result 240077 states and 282615 transitions. [2018-01-30 01:47:09,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 01:47:09,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1120 [2018-01-30 01:47:09,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:47:09,958 INFO L225 Difference]: With dead ends: 240077 [2018-01-30 01:47:09,958 INFO L226 Difference]: Without dead ends: 145973 [2018-01-30 01:47:09,989 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 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 01:47:10,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145973 states. [2018-01-30 01:47:11,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145973 to 114817. [2018-01-30 01:47:11,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114817 states. [2018-01-30 01:47:11,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114817 states to 114817 states and 133349 transitions. [2018-01-30 01:47:11,503 INFO L78 Accepts]: Start accepts. Automaton has 114817 states and 133349 transitions. Word has length 1120 [2018-01-30 01:47:11,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:47:11,504 INFO L432 AbstractCegarLoop]: Abstraction has 114817 states and 133349 transitions. [2018-01-30 01:47:11,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:47:11,504 INFO L276 IsEmpty]: Start isEmpty. Operand 114817 states and 133349 transitions. [2018-01-30 01:47:11,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1167 [2018-01-30 01:47:11,572 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:47:11,572 INFO L350 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 24, 24, 23, 23, 22, 22, 21, 21, 21, 21, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:47:11,572 INFO L371 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:47:11,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1321336883, now seen corresponding path program 1 times [2018-01-30 01:47:11,572 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:47:11,573 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:47:11,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:47:11,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:47:11,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:47:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:47:11,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:47:12,258 INFO L134 CoverageAnalysis]: Checked inductivity of 8712 backedges. 5074 proven. 27 refuted. 0 times theorem prover too weak. 3611 trivial. 0 not checked. [2018-01-30 01:47:12,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:47:12,258 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:47:12,287 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:47:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:47:12,393 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:47:13,628 INFO L134 CoverageAnalysis]: Checked inductivity of 8712 backedges. 5074 proven. 27 refuted. 0 times theorem prover too weak. 3611 trivial. 0 not checked. [2018-01-30 01:47:13,647 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:47:13,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-01-30 01:47:13,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:47:13,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:47:13,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:47:13,650 INFO L87 Difference]: Start difference. First operand 114817 states and 133349 transitions. Second operand 4 states. Received shutdown request... [2018-01-30 01:47:14,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:47:14,704 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 01:47:14,709 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 01:47:14,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:47:14 BoogieIcfgContainer [2018-01-30 01:47:14,709 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 01:47:14,710 INFO L168 Benchmark]: Toolchain (without parser) took 60266.22 ms. Allocated memory was 148.9 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 113.4 MB in the beginning and 997.3 MB in the end (delta: -883.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. [2018-01-30 01:47:14,710 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 148.9 MB. Free memory is still 118.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:47:14,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.37 ms. Allocated memory is still 148.9 MB. Free memory was 113.2 MB in the beginning and 98.5 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-01-30 01:47:14,711 INFO L168 Benchmark]: Boogie Preprocessor took 50.90 ms. Allocated memory is still 148.9 MB. Free memory was 98.5 MB in the beginning and 96.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 01:47:14,711 INFO L168 Benchmark]: RCFGBuilder took 1052.64 ms. Allocated memory is still 148.9 MB. Free memory was 96.3 MB in the beginning and 81.9 MB in the end (delta: 14.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 5.3 GB. [2018-01-30 01:47:14,711 INFO L168 Benchmark]: TraceAbstraction took 59001.12 ms. Allocated memory was 148.9 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 81.4 MB in the beginning and 997.3 MB in the end (delta: -915.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. [2018-01-30 01:47:14,712 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 148.9 MB. Free memory is still 118.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 159.37 ms. Allocated memory is still 148.9 MB. Free memory was 113.2 MB in the beginning and 98.5 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 50.90 ms. Allocated memory is still 148.9 MB. Free memory was 98.5 MB in the beginning and 96.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 1052.64 ms. Allocated memory is still 148.9 MB. Free memory was 96.3 MB in the beginning and 81.9 MB in the end (delta: 14.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 59001.12 ms. Allocated memory was 148.9 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 81.4 MB in the beginning and 997.3 MB in the end (delta: -915.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 668]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (114817states) and interpolant automaton (currently 4 states, 4 states before enhancement), while ReachableStatesComputation was computing reachable states (8671 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 446 locations, 1 error locations. TIMEOUT Result, 58.9s OverallTime, 41 OverallIterations, 26 TraceHistogramMax, 22.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 22684 SDtfs, 10313 SDslu, 19388 SDs, 0 SdLazy, 4045 SolverSat, 928 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1308 GetRequests, 1251 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114817occurred in iteration=40, 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: 18.3s AutomataMinimizationTime, 40 MinimizatonAttempts, 59290 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 23655 NumberOfCodeBlocks, 23655 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 23613 ConstructedInterpolants, 0 QuantifiedInterpolants, 20758390 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1482 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 42 InterpolantComputations, 40 PerfectInterpolantSequences, 85708/85762 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_6_true-unreach-call_false-termination.cil.c_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_01-47-14-717.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_6_true-unreach-call_false-termination.cil.c_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_01-47-14-717.csv Completed graceful shutdown