java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ssh/s3_clnt.blast.02_true-unreach-call.i.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 02:11:44,411 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 02:11:44,412 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 02:11:44,425 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 02:11:44,425 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 02:11:44,425 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 02:11:44,426 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 02:11:44,429 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 02:11:44,430 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 02:11:44,430 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 02:11:44,430 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 02:11:44,431 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 02:11:44,431 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 02:11:44,433 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 02:11:44,433 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 02:11:44,435 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 02:11:44,436 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 02:11:44,436 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 02:11:44,437 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 02:11:44,438 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 02:11:44,446 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 02:11:44,446 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 02:11:44,446 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 02:11:44,447 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 02:11:44,447 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 02:11:44,448 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 02:11:44,448 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 02:11:44,448 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 02:11:44,448 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 02:11:44,448 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 02:11:44,451 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 02:11:44,451 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 02:11:44,458 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 02:11:44,458 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 02:11:44,459 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 02:11:44,459 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 02:11:44,459 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 02:11:44,459 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 02:11:44,459 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 02:11:44,459 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 02:11:44,459 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 02:11:44,459 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 02:11:44,459 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 02:11:44,460 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 02:11:44,460 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 02:11:44,460 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 02:11:44,460 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 02:11:44,460 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 02:11:44,460 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 02:11:44,460 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 02:11:44,460 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 02:11:44,460 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 02:11:44,460 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 02:11:44,460 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 02:11:44,461 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 02:11:44,461 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 02:11:44,461 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 02:11:44,461 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 02:11:44,461 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 02:11:44,461 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 02:11:44,461 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 02:11:44,461 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 02:11:44,461 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 02:11:44,461 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 02:11:44,463 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 02:11:44,463 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 02:11:44,489 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 02:11:44,496 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 02:11:44,500 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 02:11:44,501 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 02:11:44,501 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 02:11:44,502 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_clnt.blast.02_true-unreach-call.i.cil.c [2018-01-30 02:11:44,651 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 02:11:44,652 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 02:11:44,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 02:11:44,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 02:11:44,656 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 02:11:44,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:11:44" (1/1) ... [2018-01-30 02:11:44,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e970b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:11:44, skipping insertion in model container [2018-01-30 02:11:44,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:11:44" (1/1) ... [2018-01-30 02:11:44,667 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 02:11:44,698 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 02:11:44,862 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 02:11:44,924 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 02:11:44,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:11:44 WrapperNode [2018-01-30 02:11:44,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 02:11:44,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 02:11:44,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 02:11:44,936 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 02:11:44,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:11:44" (1/1) ... [2018-01-30 02:11:44,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:11:44" (1/1) ... [2018-01-30 02:11:44,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:11:44" (1/1) ... [2018-01-30 02:11:44,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:11:44" (1/1) ... [2018-01-30 02:11:44,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:11:44" (1/1) ... [2018-01-30 02:11:44,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:11:44" (1/1) ... [2018-01-30 02:11:44,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:11:44" (1/1) ... [2018-01-30 02:11:44,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 02:11:44,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 02:11:44,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 02:11:44,973 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 02:11:44,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:11:44" (1/1) ... No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 02:11:45,024 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 02:11:45,025 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 02:11:45,025 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 02:11:45,025 INFO L136 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-01-30 02:11:45,025 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 02:11:45,025 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 02:11:45,025 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 02:11:45,025 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 02:11:45,025 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 02:11:45,025 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 02:11:45,025 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 02:11:45,025 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 02:11:45,025 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 02:11:45,026 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 02:11:45,026 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-01-30 02:11:45,026 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-01-30 02:11:45,026 INFO L128 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-01-30 02:11:45,026 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 02:11:45,026 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 02:11:45,026 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 02:11:45,271 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 02:11:45,272 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 02:11:46,348 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 02:11:46,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:11:46 BoogieIcfgContainer [2018-01-30 02:11:46,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 02:11:46,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 02:11:46,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 02:11:46,351 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 02:11:46,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:11:44" (1/3) ... [2018-01-30 02:11:46,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c109ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:11:46, skipping insertion in model container [2018-01-30 02:11:46,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:11:44" (2/3) ... [2018-01-30 02:11:46,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c109ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:11:46, skipping insertion in model container [2018-01-30 02:11:46,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:11:46" (3/3) ... [2018-01-30 02:11:46,352 INFO L107 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02_true-unreach-call.i.cil.c [2018-01-30 02:11:46,357 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 02:11:46,362 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 02:11:46,391 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 02:11:46,391 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 02:11:46,391 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 02:11:46,391 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 02:11:46,391 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 02:11:46,391 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 02:11:46,391 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 02:11:46,391 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 02:11:46,392 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 02:11:46,409 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states. [2018-01-30 02:11:46,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-01-30 02:11:46,416 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:46,416 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] [2018-01-30 02:11:46,416 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:46,419 INFO L82 PathProgramCache]: Analyzing trace with hash 2132129125, now seen corresponding path program 1 times [2018-01-30 02:11:46,420 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:46,420 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:46,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:46,452 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:46,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:46,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:46,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:11:46,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:46,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:11:46,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:11:46,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:11:46,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:11:46,777 INFO L87 Difference]: Start difference. First operand 559 states. Second operand 3 states. [2018-01-30 02:11:46,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:46,951 INFO L93 Difference]: Finished difference Result 1462 states and 1716 transitions. [2018-01-30 02:11:46,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:11:46,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2018-01-30 02:11:46,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:46,963 INFO L225 Difference]: With dead ends: 1462 [2018-01-30 02:11:46,963 INFO L226 Difference]: Without dead ends: 883 [2018-01-30 02:11:46,967 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:11:46,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2018-01-30 02:11:47,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2018-01-30 02:11:47,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2018-01-30 02:11:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 987 transitions. [2018-01-30 02:11:47,014 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 987 transitions. Word has length 133 [2018-01-30 02:11:47,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:47,014 INFO L432 AbstractCegarLoop]: Abstraction has 883 states and 987 transitions. [2018-01-30 02:11:47,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:11:47,014 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 987 transitions. [2018-01-30 02:11:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-01-30 02:11:47,018 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:47,018 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:47,018 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:47,018 INFO L82 PathProgramCache]: Analyzing trace with hash -646795636, now seen corresponding path program 1 times [2018-01-30 02:11:47,018 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:47,018 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:47,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:47,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:47,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:47,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:11:47,158 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:47,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:11:47,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:11:47,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:11:47,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:11:47,160 INFO L87 Difference]: Start difference. First operand 883 states and 987 transitions. Second operand 3 states. [2018-01-30 02:11:47,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:47,468 INFO L93 Difference]: Finished difference Result 1674 states and 1884 transitions. [2018-01-30 02:11:47,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:11:47,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2018-01-30 02:11:47,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:47,472 INFO L225 Difference]: With dead ends: 1674 [2018-01-30 02:11:47,473 INFO L226 Difference]: Without dead ends: 1271 [2018-01-30 02:11:47,474 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:11:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2018-01-30 02:11:47,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1271. [2018-01-30 02:11:47,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2018-01-30 02:11:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1422 transitions. [2018-01-30 02:11:47,495 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1422 transitions. Word has length 176 [2018-01-30 02:11:47,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:47,495 INFO L432 AbstractCegarLoop]: Abstraction has 1271 states and 1422 transitions. [2018-01-30 02:11:47,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:11:47,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1422 transitions. [2018-01-30 02:11:47,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-01-30 02:11:47,498 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:47,498 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:47,498 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:47,498 INFO L82 PathProgramCache]: Analyzing trace with hash -852932458, now seen corresponding path program 1 times [2018-01-30 02:11:47,498 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:47,499 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:47,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:47,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:47,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:47,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-30 02:11:47,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:47,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:11:47,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:11:47,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:11:47,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:11:47,641 INFO L87 Difference]: Start difference. First operand 1271 states and 1422 transitions. Second operand 3 states. [2018-01-30 02:11:47,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:47,871 INFO L93 Difference]: Finished difference Result 2458 states and 2763 transitions. [2018-01-30 02:11:47,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:11:47,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2018-01-30 02:11:47,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:47,876 INFO L225 Difference]: With dead ends: 2458 [2018-01-30 02:11:47,876 INFO L226 Difference]: Without dead ends: 1667 [2018-01-30 02:11:47,877 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:11:47,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2018-01-30 02:11:47,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1667. [2018-01-30 02:11:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1667 states. [2018-01-30 02:11:47,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 1869 transitions. [2018-01-30 02:11:47,894 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 1869 transitions. Word has length 222 [2018-01-30 02:11:47,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:47,894 INFO L432 AbstractCegarLoop]: Abstraction has 1667 states and 1869 transitions. [2018-01-30 02:11:47,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:11:47,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 1869 transitions. [2018-01-30 02:11:47,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-01-30 02:11:47,897 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:47,897 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:47,897 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:47,898 INFO L82 PathProgramCache]: Analyzing trace with hash 287329978, now seen corresponding path program 1 times [2018-01-30 02:11:47,898 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:47,898 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:47,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:47,899 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:47,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:47,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:48,326 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-30 02:11:48,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:48,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:48,327 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:48,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:48,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:48,327 INFO L87 Difference]: Start difference. First operand 1667 states and 1869 transitions. Second operand 4 states. [2018-01-30 02:11:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:49,455 INFO L93 Difference]: Finished difference Result 4136 states and 4676 transitions. [2018-01-30 02:11:49,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:49,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 278 [2018-01-30 02:11:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:49,460 INFO L225 Difference]: With dead ends: 4136 [2018-01-30 02:11:49,460 INFO L226 Difference]: Without dead ends: 2564 [2018-01-30 02:11:49,462 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:49,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2018-01-30 02:11:49,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 1835. [2018-01-30 02:11:49,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1835 states. [2018-01-30 02:11:49,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2079 transitions. [2018-01-30 02:11:49,484 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2079 transitions. Word has length 278 [2018-01-30 02:11:49,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:49,484 INFO L432 AbstractCegarLoop]: Abstraction has 1835 states and 2079 transitions. [2018-01-30 02:11:49,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:49,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2079 transitions. [2018-01-30 02:11:49,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-01-30 02:11:49,487 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:49,487 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:49,487 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:49,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1083021494, now seen corresponding path program 1 times [2018-01-30 02:11:49,488 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:49,488 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:49,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:49,489 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:49,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:49,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:49,754 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:11:49,754 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:49,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:49,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:49,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:49,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:49,755 INFO L87 Difference]: Start difference. First operand 1835 states and 2079 transitions. Second operand 4 states. [2018-01-30 02:11:50,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:50,038 INFO L93 Difference]: Finished difference Result 4130 states and 4705 transitions. [2018-01-30 02:11:50,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:11:50,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 278 [2018-01-30 02:11:50,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:50,044 INFO L225 Difference]: With dead ends: 4130 [2018-01-30 02:11:50,044 INFO L226 Difference]: Without dead ends: 2390 [2018-01-30 02:11:50,046 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:50,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2018-01-30 02:11:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 2079. [2018-01-30 02:11:50,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2079 states. [2018-01-30 02:11:50,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 2387 transitions. [2018-01-30 02:11:50,069 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 2387 transitions. Word has length 278 [2018-01-30 02:11:50,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:50,070 INFO L432 AbstractCegarLoop]: Abstraction has 2079 states and 2387 transitions. [2018-01-30 02:11:50,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:50,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 2387 transitions. [2018-01-30 02:11:50,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-01-30 02:11:50,073 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:50,073 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:50,073 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:50,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1083371701, now seen corresponding path program 1 times [2018-01-30 02:11:50,073 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:50,073 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:50,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:50,074 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:50,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:50,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:50,487 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:11:50,487 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:50,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:11:50,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:11:50,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:11:50,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:11:50,488 INFO L87 Difference]: Start difference. First operand 2079 states and 2387 transitions. Second operand 6 states. [2018-01-30 02:11:51,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:51,656 INFO L93 Difference]: Finished difference Result 6817 states and 7827 transitions. [2018-01-30 02:11:51,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 02:11:51,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 291 [2018-01-30 02:11:51,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:51,669 INFO L225 Difference]: With dead ends: 6817 [2018-01-30 02:11:51,669 INFO L226 Difference]: Without dead ends: 4833 [2018-01-30 02:11:51,672 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-30 02:11:51,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4833 states. [2018-01-30 02:11:51,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4833 to 2103. [2018-01-30 02:11:51,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2103 states. [2018-01-30 02:11:51,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 2411 transitions. [2018-01-30 02:11:51,704 INFO L78 Accepts]: Start accepts. Automaton has 2103 states and 2411 transitions. Word has length 291 [2018-01-30 02:11:51,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:51,704 INFO L432 AbstractCegarLoop]: Abstraction has 2103 states and 2411 transitions. [2018-01-30 02:11:51,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:11:51,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 2411 transitions. [2018-01-30 02:11:51,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-01-30 02:11:51,708 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:51,708 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:51,708 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:51,708 INFO L82 PathProgramCache]: Analyzing trace with hash -935542835, now seen corresponding path program 1 times [2018-01-30 02:11:51,708 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:51,708 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:51,709 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:51,709 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:51,709 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:51,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:52,061 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:11:52,061 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:52,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:52,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:52,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:52,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:52,062 INFO L87 Difference]: Start difference. First operand 2103 states and 2411 transitions. Second operand 4 states. [2018-01-30 02:11:52,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:52,245 INFO L93 Difference]: Finished difference Result 4562 states and 5241 transitions. [2018-01-30 02:11:52,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:52,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 313 [2018-01-30 02:11:52,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:52,250 INFO L225 Difference]: With dead ends: 4562 [2018-01-30 02:11:52,250 INFO L226 Difference]: Without dead ends: 2554 [2018-01-30 02:11:52,252 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:52,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2018-01-30 02:11:52,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2147. [2018-01-30 02:11:52,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2018-01-30 02:11:52,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 2459 transitions. [2018-01-30 02:11:52,276 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 2459 transitions. Word has length 313 [2018-01-30 02:11:52,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:52,276 INFO L432 AbstractCegarLoop]: Abstraction has 2147 states and 2459 transitions. [2018-01-30 02:11:52,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 2459 transitions. [2018-01-30 02:11:52,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-01-30 02:11:52,280 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:52,281 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:52,281 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:52,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1410296374, now seen corresponding path program 1 times [2018-01-30 02:11:52,281 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:52,281 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:52,282 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:52,282 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:52,282 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:52,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:52,645 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:11:52,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:52,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:52,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:52,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:52,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:52,646 INFO L87 Difference]: Start difference. First operand 2147 states and 2459 transitions. Second operand 4 states. [2018-01-30 02:11:53,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:53,070 INFO L93 Difference]: Finished difference Result 4602 states and 5281 transitions. [2018-01-30 02:11:53,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:53,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 316 [2018-01-30 02:11:53,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:53,083 INFO L225 Difference]: With dead ends: 4602 [2018-01-30 02:11:53,083 INFO L226 Difference]: Without dead ends: 2550 [2018-01-30 02:11:53,085 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:53,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2018-01-30 02:11:53,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2159. [2018-01-30 02:11:53,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2159 states. [2018-01-30 02:11:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 2471 transitions. [2018-01-30 02:11:53,106 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 2471 transitions. Word has length 316 [2018-01-30 02:11:53,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:53,106 INFO L432 AbstractCegarLoop]: Abstraction has 2159 states and 2471 transitions. [2018-01-30 02:11:53,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:53,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 2471 transitions. [2018-01-30 02:11:53,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-01-30 02:11:53,109 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:53,109 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:53,109 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:53,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1172053263, now seen corresponding path program 1 times [2018-01-30 02:11:53,109 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:53,109 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:53,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:53,110 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:53,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:53,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:53,475 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:11:53,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:53,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:53,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:53,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:53,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:53,476 INFO L87 Difference]: Start difference. First operand 2159 states and 2471 transitions. Second operand 4 states. [2018-01-30 02:11:54,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:54,043 INFO L93 Difference]: Finished difference Result 4602 states and 5277 transitions. [2018-01-30 02:11:54,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:54,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 317 [2018-01-30 02:11:54,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:54,056 INFO L225 Difference]: With dead ends: 4602 [2018-01-30 02:11:54,056 INFO L226 Difference]: Without dead ends: 2538 [2018-01-30 02:11:54,058 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:54,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2018-01-30 02:11:54,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2159. [2018-01-30 02:11:54,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2159 states. [2018-01-30 02:11:54,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 2467 transitions. [2018-01-30 02:11:54,105 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 2467 transitions. Word has length 317 [2018-01-30 02:11:54,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:54,106 INFO L432 AbstractCegarLoop]: Abstraction has 2159 states and 2467 transitions. [2018-01-30 02:11:54,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:54,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 2467 transitions. [2018-01-30 02:11:54,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-01-30 02:11:54,108 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:54,108 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:54,108 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:54,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1271280075, now seen corresponding path program 1 times [2018-01-30 02:11:54,109 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:54,109 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:54,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:54,109 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:54,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:54,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:54,484 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:11:54,484 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:54,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:54,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:54,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:54,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:54,485 INFO L87 Difference]: Start difference. First operand 2159 states and 2467 transitions. Second operand 4 states. [2018-01-30 02:11:54,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:54,749 INFO L93 Difference]: Finished difference Result 4598 states and 5265 transitions. [2018-01-30 02:11:54,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:54,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 319 [2018-01-30 02:11:54,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:54,760 INFO L225 Difference]: With dead ends: 4598 [2018-01-30 02:11:54,760 INFO L226 Difference]: Without dead ends: 2534 [2018-01-30 02:11:54,762 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:54,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2018-01-30 02:11:54,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 2171. [2018-01-30 02:11:54,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2171 states. [2018-01-30 02:11:54,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 2479 transitions. [2018-01-30 02:11:54,810 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 2479 transitions. Word has length 319 [2018-01-30 02:11:54,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:54,810 INFO L432 AbstractCegarLoop]: Abstraction has 2171 states and 2479 transitions. [2018-01-30 02:11:54,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:54,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 2479 transitions. [2018-01-30 02:11:54,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-01-30 02:11:54,813 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:54,813 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:54,813 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:54,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1965954496, now seen corresponding path program 1 times [2018-01-30 02:11:54,813 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:54,814 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:54,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:54,814 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:54,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:54,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:55,027 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:11:55,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:55,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:55,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:55,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:55,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:55,028 INFO L87 Difference]: Start difference. First operand 2171 states and 2479 transitions. Second operand 4 states. [2018-01-30 02:11:55,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:55,205 INFO L93 Difference]: Finished difference Result 4087 states and 4673 transitions. [2018-01-30 02:11:55,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:55,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 321 [2018-01-30 02:11:55,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:55,210 INFO L225 Difference]: With dead ends: 4087 [2018-01-30 02:11:55,210 INFO L226 Difference]: Without dead ends: 2530 [2018-01-30 02:11:55,211 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:55,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2018-01-30 02:11:55,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2195. [2018-01-30 02:11:55,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2195 states. [2018-01-30 02:11:55,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 2507 transitions. [2018-01-30 02:11:55,232 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 2507 transitions. Word has length 321 [2018-01-30 02:11:55,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:55,233 INFO L432 AbstractCegarLoop]: Abstraction has 2195 states and 2507 transitions. [2018-01-30 02:11:55,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:55,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 2507 transitions. [2018-01-30 02:11:55,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-01-30 02:11:55,235 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:55,235 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:55,235 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:55,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1593177890, now seen corresponding path program 1 times [2018-01-30 02:11:55,236 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:55,236 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:55,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:55,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:55,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:55,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:11:55,448 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:55,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:55,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:55,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:55,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:55,448 INFO L87 Difference]: Start difference. First operand 2195 states and 2507 transitions. Second operand 4 states. [2018-01-30 02:11:55,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:55,607 INFO L93 Difference]: Finished difference Result 4554 states and 5209 transitions. [2018-01-30 02:11:55,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:55,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2018-01-30 02:11:55,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:55,611 INFO L225 Difference]: With dead ends: 4554 [2018-01-30 02:11:55,611 INFO L226 Difference]: Without dead ends: 2454 [2018-01-30 02:11:55,613 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:55,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2018-01-30 02:11:55,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 2195. [2018-01-30 02:11:55,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2195 states. [2018-01-30 02:11:55,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 2503 transitions. [2018-01-30 02:11:55,634 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 2503 transitions. Word has length 322 [2018-01-30 02:11:55,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:55,634 INFO L432 AbstractCegarLoop]: Abstraction has 2195 states and 2503 transitions. [2018-01-30 02:11:55,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:55,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 2503 transitions. [2018-01-30 02:11:55,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-01-30 02:11:55,636 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:55,636 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:55,636 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:55,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1537493993, now seen corresponding path program 1 times [2018-01-30 02:11:55,637 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:55,637 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:55,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:55,637 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:55,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:55,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:11:55,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:55,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:55,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:55,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:55,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:55,988 INFO L87 Difference]: Start difference. First operand 2195 states and 2503 transitions. Second operand 4 states. [2018-01-30 02:11:56,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:56,185 INFO L93 Difference]: Finished difference Result 4550 states and 5197 transitions. [2018-01-30 02:11:56,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:56,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 323 [2018-01-30 02:11:56,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:56,199 INFO L225 Difference]: With dead ends: 4550 [2018-01-30 02:11:56,199 INFO L226 Difference]: Without dead ends: 2450 [2018-01-30 02:11:56,201 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:56,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2018-01-30 02:11:56,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2219. [2018-01-30 02:11:56,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2219 states. [2018-01-30 02:11:56,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 2219 states and 2531 transitions. [2018-01-30 02:11:56,221 INFO L78 Accepts]: Start accepts. Automaton has 2219 states and 2531 transitions. Word has length 323 [2018-01-30 02:11:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:56,221 INFO L432 AbstractCegarLoop]: Abstraction has 2219 states and 2531 transitions. [2018-01-30 02:11:56,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:56,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 2531 transitions. [2018-01-30 02:11:56,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-01-30 02:11:56,224 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:56,224 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:56,224 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:56,224 INFO L82 PathProgramCache]: Analyzing trace with hash -144011991, now seen corresponding path program 1 times [2018-01-30 02:11:56,224 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:56,224 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:56,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:56,225 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:56,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:56,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:11:56,438 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:56,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:56,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:56,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:56,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:56,439 INFO L87 Difference]: Start difference. First operand 2219 states and 2531 transitions. Second operand 4 states. [2018-01-30 02:11:56,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:56,629 INFO L93 Difference]: Finished difference Result 4008 states and 4574 transitions. [2018-01-30 02:11:56,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:56,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2018-01-30 02:11:56,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:56,632 INFO L225 Difference]: With dead ends: 4008 [2018-01-30 02:11:56,632 INFO L226 Difference]: Without dead ends: 2415 [2018-01-30 02:11:56,634 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:56,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2018-01-30 02:11:56,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 2219. [2018-01-30 02:11:56,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2219 states. [2018-01-30 02:11:56,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 2219 states and 2527 transitions. [2018-01-30 02:11:56,652 INFO L78 Accepts]: Start accepts. Automaton has 2219 states and 2527 transitions. Word has length 324 [2018-01-30 02:11:56,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:56,652 INFO L432 AbstractCegarLoop]: Abstraction has 2219 states and 2527 transitions. [2018-01-30 02:11:56,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:56,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 2527 transitions. [2018-01-30 02:11:56,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-01-30 02:11:56,654 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:56,655 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:56,655 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:56,655 INFO L82 PathProgramCache]: Analyzing trace with hash -909488110, now seen corresponding path program 1 times [2018-01-30 02:11:56,655 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:56,655 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:56,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:56,656 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:56,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:56,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:56,920 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:11:56,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:56,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:56,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:56,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:56,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:56,921 INFO L87 Difference]: Start difference. First operand 2219 states and 2527 transitions. Second operand 4 states. [2018-01-30 02:11:57,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:57,134 INFO L93 Difference]: Finished difference Result 4497 states and 5128 transitions. [2018-01-30 02:11:57,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:57,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2018-01-30 02:11:57,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:57,144 INFO L225 Difference]: With dead ends: 4497 [2018-01-30 02:11:57,144 INFO L226 Difference]: Without dead ends: 2373 [2018-01-30 02:11:57,149 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:57,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2018-01-30 02:11:57,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2231. [2018-01-30 02:11:57,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2018-01-30 02:11:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2539 transitions. [2018-01-30 02:11:57,170 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2539 transitions. Word has length 326 [2018-01-30 02:11:57,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:57,170 INFO L432 AbstractCegarLoop]: Abstraction has 2231 states and 2539 transitions. [2018-01-30 02:11:57,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2539 transitions. [2018-01-30 02:11:57,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-01-30 02:11:57,173 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:57,173 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:57,173 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:57,173 INFO L82 PathProgramCache]: Analyzing trace with hash 691613550, now seen corresponding path program 1 times [2018-01-30 02:11:57,173 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:57,173 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:57,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:57,174 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:57,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:57,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:11:57,385 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:57,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:11:57,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:11:57,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:11:57,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:11:57,386 INFO L87 Difference]: Start difference. First operand 2231 states and 2539 transitions. Second operand 6 states. [2018-01-30 02:11:57,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:57,785 INFO L93 Difference]: Finished difference Result 6744 states and 7654 transitions. [2018-01-30 02:11:57,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:11:57,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 326 [2018-01-30 02:11:57,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:57,789 INFO L225 Difference]: With dead ends: 6744 [2018-01-30 02:11:57,789 INFO L226 Difference]: Without dead ends: 4608 [2018-01-30 02:11:57,792 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-30 02:11:57,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states. [2018-01-30 02:11:57,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 2231. [2018-01-30 02:11:57,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2018-01-30 02:11:57,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2535 transitions. [2018-01-30 02:11:57,818 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2535 transitions. Word has length 326 [2018-01-30 02:11:57,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:57,819 INFO L432 AbstractCegarLoop]: Abstraction has 2231 states and 2535 transitions. [2018-01-30 02:11:57,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:11:57,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2535 transitions. [2018-01-30 02:11:57,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-01-30 02:11:57,821 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:57,821 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:57,821 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:57,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1269708043, now seen corresponding path program 1 times [2018-01-30 02:11:57,821 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:57,821 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:57,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:57,822 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:57,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:57,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:58,299 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:11:58,299 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:58,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:11:58,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:11:58,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:11:58,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:11:58,300 INFO L87 Difference]: Start difference. First operand 2231 states and 2535 transitions. Second operand 6 states. [2018-01-30 02:11:58,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:58,672 INFO L93 Difference]: Finished difference Result 6740 states and 7642 transitions. [2018-01-30 02:11:58,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:11:58,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 329 [2018-01-30 02:11:58,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:58,677 INFO L225 Difference]: With dead ends: 6740 [2018-01-30 02:11:58,677 INFO L226 Difference]: Without dead ends: 4604 [2018-01-30 02:11:58,679 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-30 02:11:58,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4604 states. [2018-01-30 02:11:58,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4604 to 2231. [2018-01-30 02:11:58,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2018-01-30 02:11:58,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2531 transitions. [2018-01-30 02:11:58,706 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2531 transitions. Word has length 329 [2018-01-30 02:11:58,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:58,706 INFO L432 AbstractCegarLoop]: Abstraction has 2231 states and 2531 transitions. [2018-01-30 02:11:58,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:11:58,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2531 transitions. [2018-01-30 02:11:58,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-01-30 02:11:58,708 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:58,708 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:58,708 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:58,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1647155730, now seen corresponding path program 1 times [2018-01-30 02:11:58,708 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:58,708 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:58,709 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:58,709 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:58,709 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:58,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:58,961 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:11:58,961 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:58,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:11:58,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:11:58,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:11:58,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:11:58,962 INFO L87 Difference]: Start difference. First operand 2231 states and 2531 transitions. Second operand 6 states. [2018-01-30 02:11:59,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:59,454 INFO L93 Difference]: Finished difference Result 6728 states and 7622 transitions. [2018-01-30 02:11:59,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:11:59,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 330 [2018-01-30 02:11:59,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:59,459 INFO L225 Difference]: With dead ends: 6728 [2018-01-30 02:11:59,460 INFO L226 Difference]: Without dead ends: 4592 [2018-01-30 02:11:59,462 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:11:59,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4592 states. [2018-01-30 02:11:59,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4592 to 2231. [2018-01-30 02:11:59,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2018-01-30 02:11:59,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2527 transitions. [2018-01-30 02:11:59,490 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2527 transitions. Word has length 330 [2018-01-30 02:11:59,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:59,490 INFO L432 AbstractCegarLoop]: Abstraction has 2231 states and 2527 transitions. [2018-01-30 02:11:59,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:11:59,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2527 transitions. [2018-01-30 02:11:59,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-01-30 02:11:59,492 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:59,492 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:59,492 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:59,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2135801578, now seen corresponding path program 1 times [2018-01-30 02:11:59,492 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:59,492 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:59,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:59,493 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:59,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:59,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:59,742 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:11:59,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:59,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:11:59,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:11:59,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:11:59,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:11:59,743 INFO L87 Difference]: Start difference. First operand 2231 states and 2527 transitions. Second operand 6 states. [2018-01-30 02:12:00,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:00,166 INFO L93 Difference]: Finished difference Result 6724 states and 7610 transitions. [2018-01-30 02:12:00,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:12:00,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 332 [2018-01-30 02:12:00,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:00,170 INFO L225 Difference]: With dead ends: 6724 [2018-01-30 02:12:00,170 INFO L226 Difference]: Without dead ends: 4588 [2018-01-30 02:12:00,172 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-30 02:12:00,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4588 states. [2018-01-30 02:12:00,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4588 to 2231. [2018-01-30 02:12:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2018-01-30 02:12:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2523 transitions. [2018-01-30 02:12:00,200 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2523 transitions. Word has length 332 [2018-01-30 02:12:00,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:00,200 INFO L432 AbstractCegarLoop]: Abstraction has 2231 states and 2523 transitions. [2018-01-30 02:12:00,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:12:00,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2523 transitions. [2018-01-30 02:12:00,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-01-30 02:12:00,202 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:00,202 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:12:00,202 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:00,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1661085960, now seen corresponding path program 1 times [2018-01-30 02:12:00,202 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:00,202 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:00,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:00,203 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:00,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:00,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:00,306 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:12:00,306 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:12:00,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:12:00,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:12:00,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:12:00,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:12:00,307 INFO L87 Difference]: Start difference. First operand 2231 states and 2523 transitions. Second operand 3 states. [2018-01-30 02:12:00,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:00,353 INFO L93 Difference]: Finished difference Result 4374 states and 4961 transitions. [2018-01-30 02:12:00,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:12:00,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2018-01-30 02:12:00,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:00,355 INFO L225 Difference]: With dead ends: 4374 [2018-01-30 02:12:00,355 INFO L226 Difference]: Without dead ends: 2778 [2018-01-30 02:12:00,357 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:12:00,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2018-01-30 02:12:00,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2778. [2018-01-30 02:12:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2778 states. [2018-01-30 02:12:00,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2778 states to 2778 states and 3144 transitions. [2018-01-30 02:12:00,382 INFO L78 Accepts]: Start accepts. Automaton has 2778 states and 3144 transitions. Word has length 333 [2018-01-30 02:12:00,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:00,382 INFO L432 AbstractCegarLoop]: Abstraction has 2778 states and 3144 transitions. [2018-01-30 02:12:00,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:12:00,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2778 states and 3144 transitions. [2018-01-30 02:12:00,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-01-30 02:12:00,385 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:00,385 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:12:00,385 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:00,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1690824493, now seen corresponding path program 1 times [2018-01-30 02:12:00,385 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:00,385 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:00,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:00,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:00,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:00,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:00,496 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-01-30 02:12:00,496 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:12:00,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:12:00,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:12:00,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:12:00,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:12:00,497 INFO L87 Difference]: Start difference. First operand 2778 states and 3144 transitions. Second operand 3 states. [2018-01-30 02:12:00,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:00,526 INFO L93 Difference]: Finished difference Result 3331 states and 3776 transitions. [2018-01-30 02:12:00,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:12:00,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2018-01-30 02:12:00,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:00,528 INFO L225 Difference]: With dead ends: 3331 [2018-01-30 02:12:00,528 INFO L226 Difference]: Without dead ends: 3329 [2018-01-30 02:12:00,529 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:12:00,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2018-01-30 02:12:00,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2018-01-30 02:12:00,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3329 states. [2018-01-30 02:12:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 3774 transitions. [2018-01-30 02:12:00,556 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 3774 transitions. Word has length 334 [2018-01-30 02:12:00,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:00,557 INFO L432 AbstractCegarLoop]: Abstraction has 3329 states and 3774 transitions. [2018-01-30 02:12:00,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:12:00,557 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 3774 transitions. [2018-01-30 02:12:00,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-01-30 02:12:00,559 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:00,560 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:12:00,560 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:00,560 INFO L82 PathProgramCache]: Analyzing trace with hash -380932962, now seen corresponding path program 1 times [2018-01-30 02:12:00,560 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:00,560 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:00,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:00,561 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:00,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:00,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-01-30 02:12:00,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:12:00,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:12:00,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:12:00,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:12:00,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:12:00,925 INFO L87 Difference]: Start difference. First operand 3329 states and 3774 transitions. Second operand 6 states. [2018-01-30 02:12:02,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:02,122 INFO L93 Difference]: Finished difference Result 9867 states and 11273 transitions. [2018-01-30 02:12:02,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 02:12:02,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 378 [2018-01-30 02:12:02,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:02,126 INFO L225 Difference]: With dead ends: 9867 [2018-01-30 02:12:02,126 INFO L226 Difference]: Without dead ends: 6633 [2018-01-30 02:12:02,130 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-30 02:12:02,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6633 states. [2018-01-30 02:12:02,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6633 to 3946. [2018-01-30 02:12:02,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2018-01-30 02:12:02,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 4549 transitions. [2018-01-30 02:12:02,174 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 4549 transitions. Word has length 378 [2018-01-30 02:12:02,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:02,174 INFO L432 AbstractCegarLoop]: Abstraction has 3946 states and 4549 transitions. [2018-01-30 02:12:02,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:12:02,174 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 4549 transitions. [2018-01-30 02:12:02,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-01-30 02:12:02,177 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:02,178 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:12:02,178 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:02,178 INFO L82 PathProgramCache]: Analyzing trace with hash 880482556, now seen corresponding path program 1 times [2018-01-30 02:12:02,178 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:02,178 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:02,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:02,179 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:02,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:02,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:02,475 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2018-01-30 02:12:02,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:12:02,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:12:02,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:12:02,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:12:02,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:12:02,476 INFO L87 Difference]: Start difference. First operand 3946 states and 4549 transitions. Second operand 4 states. [2018-01-30 02:12:02,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:02,658 INFO L93 Difference]: Finished difference Result 7648 states and 8836 transitions. [2018-01-30 02:12:02,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:12:02,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 384 [2018-01-30 02:12:02,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:02,661 INFO L225 Difference]: With dead ends: 7648 [2018-01-30 02:12:02,661 INFO L226 Difference]: Without dead ends: 4447 [2018-01-30 02:12:02,664 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:12:02,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4447 states. [2018-01-30 02:12:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4447 to 4191. [2018-01-30 02:12:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4191 states. [2018-01-30 02:12:02,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4191 states to 4191 states and 4854 transitions. [2018-01-30 02:12:02,701 INFO L78 Accepts]: Start accepts. Automaton has 4191 states and 4854 transitions. Word has length 384 [2018-01-30 02:12:02,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:02,702 INFO L432 AbstractCegarLoop]: Abstraction has 4191 states and 4854 transitions. [2018-01-30 02:12:02,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:12:02,702 INFO L276 IsEmpty]: Start isEmpty. Operand 4191 states and 4854 transitions. [2018-01-30 02:12:02,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-01-30 02:12:02,705 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:02,705 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:12:02,705 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:02,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1533785596, now seen corresponding path program 1 times [2018-01-30 02:12:02,705 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:02,705 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:02,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:02,706 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:02,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:02,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:03,157 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-01-30 02:12:03,158 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:12:03,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:12:03,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:12:03,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:12:03,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:12:03,158 INFO L87 Difference]: Start difference. First operand 4191 states and 4854 transitions. Second operand 6 states. [2018-01-30 02:12:03,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:03,653 INFO L93 Difference]: Finished difference Result 10286 states and 11853 transitions. [2018-01-30 02:12:03,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 02:12:03,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 394 [2018-01-30 02:12:03,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:03,657 INFO L225 Difference]: With dead ends: 10286 [2018-01-30 02:12:03,657 INFO L226 Difference]: Without dead ends: 6834 [2018-01-30 02:12:03,661 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-30 02:12:03,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6834 states. [2018-01-30 02:12:03,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6834 to 4206. [2018-01-30 02:12:03,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4206 states. [2018-01-30 02:12:03,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4206 states to 4206 states and 4869 transitions. [2018-01-30 02:12:03,706 INFO L78 Accepts]: Start accepts. Automaton has 4206 states and 4869 transitions. Word has length 394 [2018-01-30 02:12:03,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:03,706 INFO L432 AbstractCegarLoop]: Abstraction has 4206 states and 4869 transitions. [2018-01-30 02:12:03,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:12:03,707 INFO L276 IsEmpty]: Start isEmpty. Operand 4206 states and 4869 transitions. [2018-01-30 02:12:03,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-01-30 02:12:03,709 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:03,710 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-30 02:12:03,710 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:03,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1627044228, now seen corresponding path program 1 times [2018-01-30 02:12:03,710 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:03,710 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:03,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:03,711 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:03,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:03,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:04,106 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-01-30 02:12:04,106 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:12:04,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 02:12:04,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 02:12:04,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 02:12:04,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-30 02:12:04,107 INFO L87 Difference]: Start difference. First operand 4206 states and 4869 transitions. Second operand 8 states. [2018-01-30 02:12:05,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:05,194 INFO L93 Difference]: Finished difference Result 16153 states and 18597 transitions. [2018-01-30 02:12:05,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 02:12:05,195 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 404 [2018-01-30 02:12:05,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:05,202 INFO L225 Difference]: With dead ends: 16153 [2018-01-30 02:12:05,203 INFO L226 Difference]: Without dead ends: 12689 [2018-01-30 02:12:05,207 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-01-30 02:12:05,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12689 states. [2018-01-30 02:12:05,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12689 to 4351. [2018-01-30 02:12:05,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4351 states. [2018-01-30 02:12:05,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4351 states to 4351 states and 5039 transitions. [2018-01-30 02:12:05,274 INFO L78 Accepts]: Start accepts. Automaton has 4351 states and 5039 transitions. Word has length 404 [2018-01-30 02:12:05,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:05,274 INFO L432 AbstractCegarLoop]: Abstraction has 4351 states and 5039 transitions. [2018-01-30 02:12:05,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 02:12:05,274 INFO L276 IsEmpty]: Start isEmpty. Operand 4351 states and 5039 transitions. [2018-01-30 02:12:05,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-01-30 02:12:05,277 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:05,278 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-30 02:12:05,278 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:05,278 INFO L82 PathProgramCache]: Analyzing trace with hash -717797643, now seen corresponding path program 2 times [2018-01-30 02:12:05,278 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:05,278 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:05,279 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:05,279 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:05,279 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:05,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:05,655 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-01-30 02:12:05,655 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:12:05,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:12:05,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:12:05,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:12:05,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:12:05,656 INFO L87 Difference]: Start difference. First operand 4351 states and 5039 transitions. Second operand 6 states. [2018-01-30 02:12:06,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:06,082 INFO L93 Difference]: Finished difference Result 11857 states and 13740 transitions. [2018-01-30 02:12:06,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 02:12:06,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 407 [2018-01-30 02:12:06,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:06,091 INFO L225 Difference]: With dead ends: 11857 [2018-01-30 02:12:06,092 INFO L226 Difference]: Without dead ends: 8283 [2018-01-30 02:12:06,096 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-30 02:12:06,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8283 states. [2018-01-30 02:12:06,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8283 to 4381. [2018-01-30 02:12:06,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4381 states. [2018-01-30 02:12:06,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 4381 states and 5069 transitions. [2018-01-30 02:12:06,151 INFO L78 Accepts]: Start accepts. Automaton has 4381 states and 5069 transitions. Word has length 407 [2018-01-30 02:12:06,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:06,151 INFO L432 AbstractCegarLoop]: Abstraction has 4381 states and 5069 transitions. [2018-01-30 02:12:06,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:12:06,151 INFO L276 IsEmpty]: Start isEmpty. Operand 4381 states and 5069 transitions. [2018-01-30 02:12:06,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-01-30 02:12:06,155 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:06,155 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:12:06,155 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:06,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1077746163, now seen corresponding path program 1 times [2018-01-30 02:12:06,155 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:06,155 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:06,156 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:06,156 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:12:06,156 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:06,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 277 proven. 55 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-01-30 02:12:06,691 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:12:06,691 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:12:06,697 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:06,776 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:12:06,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:12:06,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:12:06,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:06,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:06,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:06,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:12:06,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-30 02:12:06,930 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:06,949 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:06,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-30 02:12:06,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:07,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:07,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:07,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-30 02:12:07,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-30 02:12:07,144 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:07,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:07,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 02:12:07,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:07,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:07,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:07,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-01-30 02:12:07,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:12:07,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:12:07,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:07,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:07,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:07,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:12:07,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-30 02:12:07,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-30 02:12:07,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:07,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:07,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:07,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2018-01-30 02:12:07,350 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-01-30 02:12:07,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:12:07,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-01-30 02:12:07,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 02:12:07,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 02:12:07,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-30 02:12:07,369 INFO L87 Difference]: Start difference. First operand 4381 states and 5069 transitions. Second operand 11 states. [2018-01-30 02:12:08,479 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 15 DAG size of output 13 [2018-01-30 02:12:11,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:11,244 INFO L93 Difference]: Finished difference Result 15922 states and 18370 transitions. [2018-01-30 02:12:11,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 02:12:11,245 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 429 [2018-01-30 02:12:11,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:11,261 INFO L225 Difference]: With dead ends: 15922 [2018-01-30 02:12:11,261 INFO L226 Difference]: Without dead ends: 11636 [2018-01-30 02:12:11,268 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 430 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=691, Unknown=0, NotChecked=0, Total=870 [2018-01-30 02:12:11,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11636 states. [2018-01-30 02:12:11,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11636 to 4321. [2018-01-30 02:12:11,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2018-01-30 02:12:11,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 4973 transitions. [2018-01-30 02:12:11,358 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 4973 transitions. Word has length 429 [2018-01-30 02:12:11,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:11,359 INFO L432 AbstractCegarLoop]: Abstraction has 4321 states and 4973 transitions. [2018-01-30 02:12:11,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 02:12:11,359 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 4973 transitions. [2018-01-30 02:12:11,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-01-30 02:12:11,364 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:11,365 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-30 02:12:11,365 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:11,365 INFO L82 PathProgramCache]: Analyzing trace with hash -224280482, now seen corresponding path program 1 times [2018-01-30 02:12:11,365 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:11,365 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:11,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:11,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:11,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:11,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 459 proven. 9 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-01-30 02:12:11,923 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:12:11,923 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:12:11,927 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:11,994 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:12:12,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:12:12,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:12:12,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:12,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:12,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:12,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:12:12,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-01-30 02:12:12,091 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:12,092 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:12,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-30 02:12:12,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:12,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:12,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:12,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2018-01-30 02:12:12,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-30 02:12:12,112 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:12,112 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:12,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 02:12:12,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:12,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:12,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:12,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-01-30 02:12:12,191 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-01-30 02:12:12,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:12:12,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2018-01-30 02:12:12,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 02:12:12,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 02:12:12,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-30 02:12:12,212 INFO L87 Difference]: Start difference. First operand 4321 states and 4973 transitions. Second operand 7 states. [2018-01-30 02:12:13,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:13,008 INFO L93 Difference]: Finished difference Result 11359 states and 13045 transitions. [2018-01-30 02:12:13,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:12:13,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 454 [2018-01-30 02:12:13,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:13,017 INFO L225 Difference]: With dead ends: 11359 [2018-01-30 02:12:13,017 INFO L226 Difference]: Without dead ends: 7133 [2018-01-30 02:12:13,022 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 455 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:12:13,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7133 states. [2018-01-30 02:12:13,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7133 to 4391. [2018-01-30 02:12:13,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4391 states. [2018-01-30 02:12:13,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4391 states to 4391 states and 5048 transitions. [2018-01-30 02:12:13,088 INFO L78 Accepts]: Start accepts. Automaton has 4391 states and 5048 transitions. Word has length 454 [2018-01-30 02:12:13,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:13,088 INFO L432 AbstractCegarLoop]: Abstraction has 4391 states and 5048 transitions. [2018-01-30 02:12:13,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 02:12:13,088 INFO L276 IsEmpty]: Start isEmpty. Operand 4391 states and 5048 transitions. [2018-01-30 02:12:13,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2018-01-30 02:12:13,092 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:13,092 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:12:13,092 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:13,093 INFO L82 PathProgramCache]: Analyzing trace with hash 295132235, now seen corresponding path program 1 times [2018-01-30 02:12:13,093 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:13,093 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:13,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:13,093 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:13,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:13,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:13,681 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 417 proven. 21 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-01-30 02:12:13,682 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:12:13,682 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:12:13,687 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:13,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:12:13,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:12:13,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:12:13,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:13,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:13,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:13,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:12:13,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-01-30 02:12:13,800 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:13,800 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:13,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-30 02:12:13,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:13,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:13,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:13,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2018-01-30 02:12:13,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-30 02:12:13,819 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:13,820 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:13,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 02:12:13,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:13,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:13,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:13,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-01-30 02:12:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 417 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2018-01-30 02:12:13,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:12:13,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2018-01-30 02:12:13,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 02:12:13,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 02:12:13,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-30 02:12:13,930 INFO L87 Difference]: Start difference. First operand 4391 states and 5048 transitions. Second operand 7 states. [2018-01-30 02:12:14,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:14,476 INFO L93 Difference]: Finished difference Result 11414 states and 13100 transitions. [2018-01-30 02:12:14,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:12:14,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 455 [2018-01-30 02:12:14,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:14,481 INFO L225 Difference]: With dead ends: 11414 [2018-01-30 02:12:14,481 INFO L226 Difference]: Without dead ends: 7118 [2018-01-30 02:12:14,486 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 456 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:12:14,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7118 states. [2018-01-30 02:12:14,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7118 to 4391. [2018-01-30 02:12:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4391 states. [2018-01-30 02:12:14,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4391 states to 4391 states and 5043 transitions. [2018-01-30 02:12:14,553 INFO L78 Accepts]: Start accepts. Automaton has 4391 states and 5043 transitions. Word has length 455 [2018-01-30 02:12:14,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:14,553 INFO L432 AbstractCegarLoop]: Abstraction has 4391 states and 5043 transitions. [2018-01-30 02:12:14,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 02:12:14,553 INFO L276 IsEmpty]: Start isEmpty. Operand 4391 states and 5043 transitions. [2018-01-30 02:12:14,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-01-30 02:12:14,557 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:14,557 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-30 02:12:14,557 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:14,557 INFO L82 PathProgramCache]: Analyzing trace with hash -408704945, now seen corresponding path program 1 times [2018-01-30 02:12:14,557 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:14,557 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:14,558 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:14,558 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:14,558 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:14,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 352 proven. 47 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2018-01-30 02:12:14,823 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:12:14,823 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:12:14,828 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:14,890 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:12:14,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:12:14,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:12:14,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:14,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:14,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:14,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:12:14,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-30 02:12:14,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:14,983 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:14,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-30 02:12:14,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:14,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:14,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:14,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-30 02:12:14,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-30 02:12:15,000 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:15,001 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:15,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 02:12:15,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:15,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:15,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:15,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-01-30 02:12:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2018-01-30 02:12:15,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:12:15,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-01-30 02:12:15,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 02:12:15,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 02:12:15,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-30 02:12:15,133 INFO L87 Difference]: Start difference. First operand 4391 states and 5043 transitions. Second operand 9 states. [2018-01-30 02:12:15,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:15,752 INFO L93 Difference]: Finished difference Result 10073 states and 11567 transitions. [2018-01-30 02:12:15,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 02:12:15,752 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 457 [2018-01-30 02:12:15,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:15,757 INFO L225 Difference]: With dead ends: 10073 [2018-01-30 02:12:15,757 INFO L226 Difference]: Without dead ends: 5777 [2018-01-30 02:12:15,761 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 456 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-01-30 02:12:15,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5777 states. [2018-01-30 02:12:15,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5777 to 4421. [2018-01-30 02:12:15,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4421 states. [2018-01-30 02:12:15,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4421 states to 4421 states and 5062 transitions. [2018-01-30 02:12:15,821 INFO L78 Accepts]: Start accepts. Automaton has 4421 states and 5062 transitions. Word has length 457 [2018-01-30 02:12:15,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:15,821 INFO L432 AbstractCegarLoop]: Abstraction has 4421 states and 5062 transitions. [2018-01-30 02:12:15,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 02:12:15,821 INFO L276 IsEmpty]: Start isEmpty. Operand 4421 states and 5062 transitions. [2018-01-30 02:12:15,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2018-01-30 02:12:15,824 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:15,824 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:12:15,825 INFO L371 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:15,825 INFO L82 PathProgramCache]: Analyzing trace with hash 89681761, now seen corresponding path program 1 times [2018-01-30 02:12:15,825 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:15,825 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:15,825 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:15,825 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:15,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:15,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:16,232 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 319 proven. 74 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-30 02:12:16,232 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:12:16,233 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:12:16,237 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:16,300 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:12:16,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:12:16,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:12:16,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:16,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:16,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:16,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:12:16,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-30 02:12:16,328 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:16,328 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:16,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-30 02:12:16,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:16,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:16,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:16,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-30 02:12:16,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-30 02:12:16,344 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:16,345 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:16,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 02:12:16,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:16,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:16,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:16,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-01-30 02:12:16,451 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-01-30 02:12:16,470 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:12:16,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-01-30 02:12:16,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 02:12:16,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 02:12:16,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-30 02:12:16,470 INFO L87 Difference]: Start difference. First operand 4421 states and 5062 transitions. Second operand 9 states. [2018-01-30 02:12:17,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:17,134 INFO L93 Difference]: Finished difference Result 9997 states and 11450 transitions. [2018-01-30 02:12:17,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 02:12:17,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 461 [2018-01-30 02:12:17,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:17,138 INFO L225 Difference]: With dead ends: 9997 [2018-01-30 02:12:17,138 INFO L226 Difference]: Without dead ends: 5671 [2018-01-30 02:12:17,142 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 460 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-01-30 02:12:17,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5671 states. [2018-01-30 02:12:17,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5671 to 4443. [2018-01-30 02:12:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4443 states. [2018-01-30 02:12:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4443 states to 4443 states and 5069 transitions. [2018-01-30 02:12:17,203 INFO L78 Accepts]: Start accepts. Automaton has 4443 states and 5069 transitions. Word has length 461 [2018-01-30 02:12:17,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:17,203 INFO L432 AbstractCegarLoop]: Abstraction has 4443 states and 5069 transitions. [2018-01-30 02:12:17,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 02:12:17,203 INFO L276 IsEmpty]: Start isEmpty. Operand 4443 states and 5069 transitions. [2018-01-30 02:12:17,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-01-30 02:12:17,206 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:17,206 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:12:17,206 INFO L371 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:17,207 INFO L82 PathProgramCache]: Analyzing trace with hash -757353272, now seen corresponding path program 1 times [2018-01-30 02:12:17,207 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:17,207 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:17,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:17,207 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:17,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:17,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:17,550 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-01-30 02:12:17,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:12:17,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:12:17,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:12:17,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:12:17,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:12:17,551 INFO L87 Difference]: Start difference. First operand 4443 states and 5069 transitions. Second operand 6 states. [2018-01-30 02:12:18,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:18,058 INFO L93 Difference]: Finished difference Result 11335 states and 12933 transitions. [2018-01-30 02:12:18,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 02:12:18,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 464 [2018-01-30 02:12:18,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:18,063 INFO L225 Difference]: With dead ends: 11335 [2018-01-30 02:12:18,063 INFO L226 Difference]: Without dead ends: 6994 [2018-01-30 02:12:18,068 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-30 02:12:18,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6994 states. [2018-01-30 02:12:18,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6994 to 4488. [2018-01-30 02:12:18,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4488 states. [2018-01-30 02:12:18,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 5114 transitions. [2018-01-30 02:12:18,168 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 5114 transitions. Word has length 464 [2018-01-30 02:12:18,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:18,169 INFO L432 AbstractCegarLoop]: Abstraction has 4488 states and 5114 transitions. [2018-01-30 02:12:18,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:12:18,169 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 5114 transitions. [2018-01-30 02:12:18,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-01-30 02:12:18,172 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:18,172 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-30 02:12:18,172 INFO L371 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:18,173 INFO L82 PathProgramCache]: Analyzing trace with hash 218907505, now seen corresponding path program 1 times [2018-01-30 02:12:18,173 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:18,173 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:18,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:18,173 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:18,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:18,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:18,462 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 569 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-01-30 02:12:18,463 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:12:18,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:12:18,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:12:18,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:12:18,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:12:18,463 INFO L87 Difference]: Start difference. First operand 4488 states and 5114 transitions. Second operand 6 states. [2018-01-30 02:12:18,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:19,000 INFO L93 Difference]: Finished difference Result 11326 states and 12912 transitions. [2018-01-30 02:12:19,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 02:12:19,000 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 467 [2018-01-30 02:12:19,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:19,004 INFO L225 Difference]: With dead ends: 11326 [2018-01-30 02:12:19,004 INFO L226 Difference]: Without dead ends: 6940 [2018-01-30 02:12:19,007 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-30 02:12:19,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6940 states. [2018-01-30 02:12:19,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6940 to 4503. [2018-01-30 02:12:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4503 states. [2018-01-30 02:12:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 5129 transitions. [2018-01-30 02:12:19,074 INFO L78 Accepts]: Start accepts. Automaton has 4503 states and 5129 transitions. Word has length 467 [2018-01-30 02:12:19,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:19,075 INFO L432 AbstractCegarLoop]: Abstraction has 4503 states and 5129 transitions. [2018-01-30 02:12:19,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:12:19,075 INFO L276 IsEmpty]: Start isEmpty. Operand 4503 states and 5129 transitions. [2018-01-30 02:12:19,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-01-30 02:12:19,078 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:19,078 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-30 02:12:19,078 INFO L371 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:19,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1747709956, now seen corresponding path program 1 times [2018-01-30 02:12:19,078 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:19,078 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:19,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:19,079 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:19,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:19,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 459 proven. 12 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-01-30 02:12:19,646 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:12:19,646 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:12:19,651 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:19,716 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:12:19,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:12:19,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:12:19,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:19,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:19,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:19,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:12:19,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-01-30 02:12:19,770 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:19,771 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:19,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-30 02:12:19,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:19,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:19,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:19,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2018-01-30 02:12:19,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-30 02:12:19,791 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:19,791 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:19,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 02:12:19,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:19,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:19,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:19,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-01-30 02:12:19,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:12:19,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:12:19,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:19,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:19,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:19,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:12:19,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-01-30 02:12:19,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-30 02:12:19,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:19,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:19,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:19,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:3 [2018-01-30 02:12:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-01-30 02:12:19,925 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:12:19,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10 [2018-01-30 02:12:19,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 02:12:19,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 02:12:19,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:12:19,925 INFO L87 Difference]: Start difference. First operand 4503 states and 5129 transitions. Second operand 10 states. [2018-01-30 02:12:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:21,687 INFO L93 Difference]: Finished difference Result 18000 states and 20499 transitions. [2018-01-30 02:12:21,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-30 02:12:21,687 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 470 [2018-01-30 02:12:21,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:21,694 INFO L225 Difference]: With dead ends: 18000 [2018-01-30 02:12:21,694 INFO L226 Difference]: Without dead ends: 13599 [2018-01-30 02:12:21,697 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 472 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2018-01-30 02:12:21,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13599 states. [2018-01-30 02:12:21,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13599 to 4503. [2018-01-30 02:12:21,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4503 states. [2018-01-30 02:12:21,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 5124 transitions. [2018-01-30 02:12:21,782 INFO L78 Accepts]: Start accepts. Automaton has 4503 states and 5124 transitions. Word has length 470 [2018-01-30 02:12:21,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:21,782 INFO L432 AbstractCegarLoop]: Abstraction has 4503 states and 5124 transitions. [2018-01-30 02:12:21,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 02:12:21,782 INFO L276 IsEmpty]: Start isEmpty. Operand 4503 states and 5124 transitions. [2018-01-30 02:12:21,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-01-30 02:12:21,785 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:21,785 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:12:21,785 INFO L371 AbstractCegarLoop]: === Iteration 35 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:21,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1868635377, now seen corresponding path program 1 times [2018-01-30 02:12:21,785 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:21,785 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:21,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:21,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:21,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:21,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:22,132 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 348 proven. 34 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2018-01-30 02:12:22,133 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:12:22,133 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:12:22,137 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:22,202 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:12:22,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:12:22,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:12:22,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:22,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:22,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:22,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:12:22,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-30 02:12:22,450 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:22,468 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:22,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-30 02:12:22,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:22,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:22,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:22,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-30 02:12:22,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-30 02:12:22,817 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:22,836 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:22,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 02:12:22,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:22,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:22,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:22,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-01-30 02:12:22,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:12:22,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:12:22,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:22,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:22,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:22,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:12:22,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-30 02:12:22,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-30 02:12:22,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:22,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:22,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:22,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2018-01-30 02:12:22,991 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 417 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-01-30 02:12:23,008 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:12:23,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-01-30 02:12:23,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 02:12:23,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 02:12:23,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-30 02:12:23,009 INFO L87 Difference]: Start difference. First operand 4503 states and 5124 transitions. Second operand 11 states. [2018-01-30 02:12:24,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:24,632 INFO L93 Difference]: Finished difference Result 15661 states and 17846 transitions. [2018-01-30 02:12:24,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 02:12:24,632 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 471 [2018-01-30 02:12:24,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:24,639 INFO L225 Difference]: With dead ends: 15661 [2018-01-30 02:12:24,639 INFO L226 Difference]: Without dead ends: 11260 [2018-01-30 02:12:24,643 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 472 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=691, Unknown=0, NotChecked=0, Total=870 [2018-01-30 02:12:24,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11260 states. [2018-01-30 02:12:24,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11260 to 4518. [2018-01-30 02:12:24,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4518 states. [2018-01-30 02:12:24,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4518 states to 4518 states and 5118 transitions. [2018-01-30 02:12:24,729 INFO L78 Accepts]: Start accepts. Automaton has 4518 states and 5118 transitions. Word has length 471 [2018-01-30 02:12:24,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:24,729 INFO L432 AbstractCegarLoop]: Abstraction has 4518 states and 5118 transitions. [2018-01-30 02:12:24,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 02:12:24,729 INFO L276 IsEmpty]: Start isEmpty. Operand 4518 states and 5118 transitions. [2018-01-30 02:12:24,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2018-01-30 02:12:24,731 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:24,732 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-30 02:12:24,732 INFO L371 AbstractCegarLoop]: === Iteration 36 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:24,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1411855967, now seen corresponding path program 1 times [2018-01-30 02:12:24,732 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:24,732 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:24,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:24,733 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:24,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:24,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:25,136 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 513 proven. 3 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2018-01-30 02:12:25,136 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:12:25,136 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:12:25,141 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:25,203 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:12:25,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:12:25,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:12:25,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:25,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:25,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:25,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:12:25,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-01-30 02:12:25,297 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:25,298 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:25,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-30 02:12:25,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:25,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:25,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:25,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2018-01-30 02:12:25,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-30 02:12:25,315 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:25,315 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:25,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 02:12:25,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:25,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:25,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:25,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-01-30 02:12:25,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:12:25,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:12:25,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:25,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:25,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:25,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:12:25,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-01-30 02:12:25,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-30 02:12:25,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:25,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:25,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:25,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:3 [2018-01-30 02:12:25,483 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 513 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-01-30 02:12:25,501 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:12:25,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10 [2018-01-30 02:12:25,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 02:12:25,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 02:12:25,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:12:25,502 INFO L87 Difference]: Start difference. First operand 4518 states and 5118 transitions. Second operand 10 states. [2018-01-30 02:12:26,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:26,920 INFO L93 Difference]: Finished difference Result 17889 states and 20308 transitions. [2018-01-30 02:12:26,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-30 02:12:26,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 479 [2018-01-30 02:12:26,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:26,928 INFO L225 Difference]: With dead ends: 17889 [2018-01-30 02:12:26,928 INFO L226 Difference]: Without dead ends: 13473 [2018-01-30 02:12:26,934 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 481 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2018-01-30 02:12:26,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13473 states. [2018-01-30 02:12:27,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13473 to 4518. [2018-01-30 02:12:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4518 states. [2018-01-30 02:12:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4518 states to 4518 states and 5113 transitions. [2018-01-30 02:12:27,028 INFO L78 Accepts]: Start accepts. Automaton has 4518 states and 5113 transitions. Word has length 479 [2018-01-30 02:12:27,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:27,029 INFO L432 AbstractCegarLoop]: Abstraction has 4518 states and 5113 transitions. [2018-01-30 02:12:27,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 02:12:27,029 INFO L276 IsEmpty]: Start isEmpty. Operand 4518 states and 5113 transitions. [2018-01-30 02:12:27,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2018-01-30 02:12:27,032 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:27,032 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:12:27,032 INFO L371 AbstractCegarLoop]: === Iteration 37 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:27,032 INFO L82 PathProgramCache]: Analyzing trace with hash -355713126, now seen corresponding path program 1 times [2018-01-30 02:12:27,032 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:27,032 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:27,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:27,033 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:27,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:27,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:27,417 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-01-30 02:12:27,418 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:12:27,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 02:12:27,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 02:12:27,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 02:12:27,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-30 02:12:27,418 INFO L87 Difference]: Start difference. First operand 4518 states and 5113 transitions. Second operand 8 states. [2018-01-30 02:12:28,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:28,811 INFO L93 Difference]: Finished difference Result 16908 states and 19177 transitions. [2018-01-30 02:12:28,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 02:12:28,812 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 480 [2018-01-30 02:12:28,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:28,819 INFO L225 Difference]: With dead ends: 16908 [2018-01-30 02:12:28,819 INFO L226 Difference]: Without dead ends: 12492 [2018-01-30 02:12:28,824 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-01-30 02:12:28,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12492 states. [2018-01-30 02:12:28,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12492 to 4533. [2018-01-30 02:12:28,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4533 states. [2018-01-30 02:12:28,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4533 states to 4533 states and 5128 transitions. [2018-01-30 02:12:28,924 INFO L78 Accepts]: Start accepts. Automaton has 4533 states and 5128 transitions. Word has length 480 [2018-01-30 02:12:28,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:28,924 INFO L432 AbstractCegarLoop]: Abstraction has 4533 states and 5128 transitions. [2018-01-30 02:12:28,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 02:12:28,924 INFO L276 IsEmpty]: Start isEmpty. Operand 4533 states and 5128 transitions. [2018-01-30 02:12:28,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2018-01-30 02:12:28,927 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:28,927 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:12:28,928 INFO L371 AbstractCegarLoop]: === Iteration 38 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:28,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1955981557, now seen corresponding path program 1 times [2018-01-30 02:12:28,928 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:28,928 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:28,928 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:28,928 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:28,928 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:28,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:29,267 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 405 proven. 35 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-01-30 02:12:29,267 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:12:29,267 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:12:29,272 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:29,332 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:12:29,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-30 02:12:29,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-30 02:12:29,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:29,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:29,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:29,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-01-30 02:12:29,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:12:29,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:12:29,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:29,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:29,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:29,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:12:29,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-30 02:12:29,396 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:29,396 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:29,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-30 02:12:29,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:29,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:29,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:29,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-30 02:12:29,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-30 02:12:29,435 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:29,435 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:29,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 02:12:29,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:29,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:29,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:29,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-01-30 02:12:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 405 proven. 35 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-01-30 02:12:29,547 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:12:29,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2018-01-30 02:12:29,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 02:12:29,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 02:12:29,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-30 02:12:29,548 INFO L87 Difference]: Start difference. First operand 4533 states and 5128 transitions. Second operand 9 states. [2018-01-30 02:12:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:30,078 INFO L93 Difference]: Finished difference Result 9168 states and 10380 transitions. [2018-01-30 02:12:30,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 02:12:30,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 482 [2018-01-30 02:12:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:30,081 INFO L225 Difference]: With dead ends: 9168 [2018-01-30 02:12:30,081 INFO L226 Difference]: Without dead ends: 4737 [2018-01-30 02:12:30,084 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 480 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-01-30 02:12:30,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4737 states. [2018-01-30 02:12:30,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4737 to 4548. [2018-01-30 02:12:30,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4548 states. [2018-01-30 02:12:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4548 states to 4548 states and 5132 transitions. [2018-01-30 02:12:30,162 INFO L78 Accepts]: Start accepts. Automaton has 4548 states and 5132 transitions. Word has length 482 [2018-01-30 02:12:30,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:30,162 INFO L432 AbstractCegarLoop]: Abstraction has 4548 states and 5132 transitions. [2018-01-30 02:12:30,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 02:12:30,162 INFO L276 IsEmpty]: Start isEmpty. Operand 4548 states and 5132 transitions. [2018-01-30 02:12:30,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2018-01-30 02:12:30,165 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:30,166 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:12:30,166 INFO L371 AbstractCegarLoop]: === Iteration 39 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:30,166 INFO L82 PathProgramCache]: Analyzing trace with hash -930413433, now seen corresponding path program 1 times [2018-01-30 02:12:30,166 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:30,166 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:30,166 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:30,166 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:30,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:30,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:30,897 INFO L134 CoverageAnalysis]: Checked inductivity of 919 backedges. 556 proven. 1 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-01-30 02:12:30,898 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:12:30,898 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:12:30,903 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:30,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:12:30,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:12:31,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:12:31,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:31,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:31,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:31,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:12:31,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-30 02:12:31,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:31,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:31,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-30 02:12:31,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:31,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:31,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:31,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-30 02:12:31,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-30 02:12:31,096 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:31,097 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:31,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 02:12:31,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:31,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:31,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:31,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-01-30 02:12:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 919 backedges. 569 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-01-30 02:12:31,197 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:12:31,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-01-30 02:12:31,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 02:12:31,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 02:12:31,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-30 02:12:31,198 INFO L87 Difference]: Start difference. First operand 4548 states and 5132 transitions. Second operand 8 states. [2018-01-30 02:12:32,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:32,283 INFO L93 Difference]: Finished difference Result 15218 states and 17247 transitions. [2018-01-30 02:12:32,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 02:12:32,283 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 486 [2018-01-30 02:12:32,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:32,289 INFO L225 Difference]: With dead ends: 15218 [2018-01-30 02:12:32,289 INFO L226 Difference]: Without dead ends: 10772 [2018-01-30 02:12:32,294 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 486 SyntacticMatches, 12 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-01-30 02:12:32,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10772 states. [2018-01-30 02:12:32,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10772 to 7987. [2018-01-30 02:12:32,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7987 states. [2018-01-30 02:12:32,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7987 states to 7987 states and 9055 transitions. [2018-01-30 02:12:32,431 INFO L78 Accepts]: Start accepts. Automaton has 7987 states and 9055 transitions. Word has length 486 [2018-01-30 02:12:32,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:32,431 INFO L432 AbstractCegarLoop]: Abstraction has 7987 states and 9055 transitions. [2018-01-30 02:12:32,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 02:12:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 7987 states and 9055 transitions. [2018-01-30 02:12:32,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2018-01-30 02:12:32,436 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:32,436 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:12:32,436 INFO L371 AbstractCegarLoop]: === Iteration 40 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:32,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1330918287, now seen corresponding path program 1 times [2018-01-30 02:12:32,436 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:32,436 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:32,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:32,437 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:32,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:32,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 898 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 657 trivial. 0 not checked. [2018-01-30 02:12:32,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:12:32,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:12:32,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:12:32,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:12:32,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:12:32,711 INFO L87 Difference]: Start difference. First operand 7987 states and 9055 transitions. Second operand 4 states. [2018-01-30 02:12:32,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:32,984 INFO L93 Difference]: Finished difference Result 16370 states and 18567 transitions. [2018-01-30 02:12:32,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:12:32,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 487 [2018-01-30 02:12:32,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:32,989 INFO L225 Difference]: With dead ends: 16370 [2018-01-30 02:12:32,990 INFO L226 Difference]: Without dead ends: 8485 [2018-01-30 02:12:32,996 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:12:32,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8485 states. [2018-01-30 02:12:33,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8485 to 8262. [2018-01-30 02:12:33,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8262 states. [2018-01-30 02:12:33,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8262 states to 8262 states and 9375 transitions. [2018-01-30 02:12:33,167 INFO L78 Accepts]: Start accepts. Automaton has 8262 states and 9375 transitions. Word has length 487 [2018-01-30 02:12:33,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:33,167 INFO L432 AbstractCegarLoop]: Abstraction has 8262 states and 9375 transitions. [2018-01-30 02:12:33,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:12:33,167 INFO L276 IsEmpty]: Start isEmpty. Operand 8262 states and 9375 transitions. [2018-01-30 02:12:33,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2018-01-30 02:12:33,172 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:33,172 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-30 02:12:33,172 INFO L371 AbstractCegarLoop]: === Iteration 41 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:33,172 INFO L82 PathProgramCache]: Analyzing trace with hash 862293407, now seen corresponding path program 1 times [2018-01-30 02:12:33,172 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:33,172 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:33,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:33,173 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:33,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:33,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 333 proven. 70 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2018-01-30 02:12:33,511 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:12:33,511 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:12:33,517 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:33,581 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:12:33,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:12:33,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:12:33,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:33,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:33,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:33,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:12:33,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-30 02:12:33,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:33,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:33,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-30 02:12:33,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:33,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:33,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:33,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-30 02:12:33,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-30 02:12:33,645 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:33,646 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:33,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 02:12:33,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:33,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:33,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:33,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-01-30 02:12:33,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:12:33,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:12:33,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:33,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:33,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:33,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:12:33,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-30 02:12:33,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-30 02:12:33,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:33,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:33,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:33,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2018-01-30 02:12:33,790 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 538 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-01-30 02:12:33,807 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:12:33,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2018-01-30 02:12:33,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 02:12:33,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 02:12:33,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-01-30 02:12:33,808 INFO L87 Difference]: Start difference. First operand 8262 states and 9375 transitions. Second operand 13 states. [2018-01-30 02:12:36,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:36,657 INFO L93 Difference]: Finished difference Result 37179 states and 42331 transitions. [2018-01-30 02:12:36,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-01-30 02:12:36,657 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 487 [2018-01-30 02:12:36,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:36,675 INFO L225 Difference]: With dead ends: 37179 [2018-01-30 02:12:36,675 INFO L226 Difference]: Without dead ends: 29019 [2018-01-30 02:12:36,684 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 494 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=347, Invalid=1545, Unknown=0, NotChecked=0, Total=1892 [2018-01-30 02:12:36,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29019 states. [2018-01-30 02:12:36,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29019 to 8188. [2018-01-30 02:12:36,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8188 states. [2018-01-30 02:12:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8188 states to 8188 states and 9302 transitions. [2018-01-30 02:12:36,883 INFO L78 Accepts]: Start accepts. Automaton has 8188 states and 9302 transitions. Word has length 487 [2018-01-30 02:12:36,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:36,884 INFO L432 AbstractCegarLoop]: Abstraction has 8188 states and 9302 transitions. [2018-01-30 02:12:36,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 02:12:36,884 INFO L276 IsEmpty]: Start isEmpty. Operand 8188 states and 9302 transitions. [2018-01-30 02:12:36,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-01-30 02:12:36,888 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:36,888 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:12:36,888 INFO L371 AbstractCegarLoop]: === Iteration 42 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:36,888 INFO L82 PathProgramCache]: Analyzing trace with hash -170873877, now seen corresponding path program 1 times [2018-01-30 02:12:36,888 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:36,888 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:36,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:36,889 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:36,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:36,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 947 backedges. 551 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-01-30 02:12:37,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:12:37,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:12:37,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:12:37,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:12:37,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:12:37,133 INFO L87 Difference]: Start difference. First operand 8188 states and 9302 transitions. Second operand 4 states. [2018-01-30 02:12:37,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:37,462 INFO L93 Difference]: Finished difference Result 17262 states and 19620 transitions. [2018-01-30 02:12:37,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:12:37,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 492 [2018-01-30 02:12:37,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:37,468 INFO L225 Difference]: With dead ends: 17262 [2018-01-30 02:12:37,468 INFO L226 Difference]: Without dead ends: 9176 [2018-01-30 02:12:37,473 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:12:37,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9176 states. [2018-01-30 02:12:37,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9176 to 8203. [2018-01-30 02:12:37,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8203 states. [2018-01-30 02:12:37,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8203 states to 8203 states and 9317 transitions. [2018-01-30 02:12:37,622 INFO L78 Accepts]: Start accepts. Automaton has 8203 states and 9317 transitions. Word has length 492 [2018-01-30 02:12:37,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:37,622 INFO L432 AbstractCegarLoop]: Abstraction has 8203 states and 9317 transitions. [2018-01-30 02:12:37,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:12:37,622 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 9317 transitions. [2018-01-30 02:12:37,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-01-30 02:12:37,627 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:37,627 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:12:37,627 INFO L371 AbstractCegarLoop]: === Iteration 43 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:37,627 INFO L82 PathProgramCache]: Analyzing trace with hash -41954039, now seen corresponding path program 1 times [2018-01-30 02:12:37,627 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:37,627 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:37,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:37,628 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:37,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:37,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:38,001 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 361 proven. 61 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2018-01-30 02:12:38,001 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:12:38,002 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:12:38,007 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:38,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:12:38,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-30 02:12:38,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-30 02:12:38,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:38,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:38,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:38,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-01-30 02:12:38,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:12:38,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:12:38,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:38,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:38,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:38,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:12:38,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-30 02:12:38,283 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:38,284 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:38,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-30 02:12:38,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:38,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:38,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:38,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-30 02:12:38,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-30 02:12:38,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:38,301 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:38,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 02:12:38,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:38,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:38,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:38,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-01-30 02:12:38,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:12:38,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:12:38,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:38,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:38,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:38,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:12:38,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-30 02:12:38,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-30 02:12:38,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:38,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:38,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:38,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-30 02:12:38,411 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 360 proven. 62 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2018-01-30 02:12:38,429 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:12:38,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2018-01-30 02:12:38,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 02:12:38,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 02:12:38,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-01-30 02:12:38,430 INFO L87 Difference]: Start difference. First operand 8203 states and 9317 transitions. Second operand 13 states. [2018-01-30 02:12:40,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:40,467 INFO L93 Difference]: Finished difference Result 30631 states and 34791 transitions. [2018-01-30 02:12:40,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-30 02:12:40,468 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 492 [2018-01-30 02:12:40,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:40,482 INFO L225 Difference]: With dead ends: 30631 [2018-01-30 02:12:40,482 INFO L226 Difference]: Without dead ends: 22530 [2018-01-30 02:12:40,492 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 498 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=306, Invalid=1254, Unknown=0, NotChecked=0, Total=1560 [2018-01-30 02:12:40,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22530 states. [2018-01-30 02:12:40,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22530 to 8236. [2018-01-30 02:12:40,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8236 states. [2018-01-30 02:12:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8236 states to 8236 states and 9340 transitions. [2018-01-30 02:12:40,737 INFO L78 Accepts]: Start accepts. Automaton has 8236 states and 9340 transitions. Word has length 492 [2018-01-30 02:12:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:40,737 INFO L432 AbstractCegarLoop]: Abstraction has 8236 states and 9340 transitions. [2018-01-30 02:12:40,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 02:12:40,738 INFO L276 IsEmpty]: Start isEmpty. Operand 8236 states and 9340 transitions. [2018-01-30 02:12:40,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2018-01-30 02:12:40,742 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:40,742 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-30 02:12:40,742 INFO L371 AbstractCegarLoop]: === Iteration 44 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:40,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1052824190, now seen corresponding path program 1 times [2018-01-30 02:12:40,742 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:40,743 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:40,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:40,743 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:40,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:40,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:41,115 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 325 proven. 85 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2018-01-30 02:12:41,115 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:12:41,115 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:12:41,120 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:41,184 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:12:41,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-30 02:12:41,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-30 02:12:41,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:41,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:41,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:41,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-01-30 02:12:41,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:12:41,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:12:41,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:41,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:41,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:41,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:12:41,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-30 02:12:41,339 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:41,340 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:41,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-30 02:12:41,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:41,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:41,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:41,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-30 02:12:41,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-30 02:12:41,356 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:41,357 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:41,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 02:12:41,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:41,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:41,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:41,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-01-30 02:12:41,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:12:41,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:12:41,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:41,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:41,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:41,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:12:41,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-30 02:12:41,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-30 02:12:41,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:41,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:41,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:41,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-30 02:12:41,473 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 324 proven. 86 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2018-01-30 02:12:41,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:12:41,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2018-01-30 02:12:41,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 02:12:41,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 02:12:41,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-01-30 02:12:41,491 INFO L87 Difference]: Start difference. First operand 8236 states and 9340 transitions. Second operand 13 states. [2018-01-30 02:12:43,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:43,295 INFO L93 Difference]: Finished difference Result 30628 states and 34757 transitions. [2018-01-30 02:12:43,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-30 02:12:43,296 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 493 [2018-01-30 02:12:43,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:43,308 INFO L225 Difference]: With dead ends: 30628 [2018-01-30 02:12:43,309 INFO L226 Difference]: Without dead ends: 22494 [2018-01-30 02:12:43,316 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 499 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=306, Invalid=1254, Unknown=0, NotChecked=0, Total=1560 [2018-01-30 02:12:43,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22494 states. [2018-01-30 02:12:43,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22494 to 8236. [2018-01-30 02:12:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8236 states. [2018-01-30 02:12:43,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8236 states to 8236 states and 9319 transitions. [2018-01-30 02:12:43,515 INFO L78 Accepts]: Start accepts. Automaton has 8236 states and 9319 transitions. Word has length 493 [2018-01-30 02:12:43,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:43,515 INFO L432 AbstractCegarLoop]: Abstraction has 8236 states and 9319 transitions. [2018-01-30 02:12:43,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 02:12:43,515 INFO L276 IsEmpty]: Start isEmpty. Operand 8236 states and 9319 transitions. [2018-01-30 02:12:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-01-30 02:12:43,519 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:43,519 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:12:43,520 INFO L371 AbstractCegarLoop]: === Iteration 45 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:43,520 INFO L82 PathProgramCache]: Analyzing trace with hash -2057761150, now seen corresponding path program 1 times [2018-01-30 02:12:43,520 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:43,520 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:43,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:43,520 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:43,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:43,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:43,876 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 379 proven. 49 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2018-01-30 02:12:43,877 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:12:43,877 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:12:43,882 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:43,944 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:12:44,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-30 02:12:44,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-30 02:12:44,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:44,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:44,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:44,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-01-30 02:12:44,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:12:44,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:12:44,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:44,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:44,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:44,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:12:44,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-30 02:12:44,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:44,072 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:44,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-30 02:12:44,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:44,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:44,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:44,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-30 02:12:44,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-30 02:12:44,088 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:44,088 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:44,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 02:12:44,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:44,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:44,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:44,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-01-30 02:12:44,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:12:44,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:12:44,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:44,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:44,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:44,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:12:44,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-30 02:12:44,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-30 02:12:44,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:44,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:44,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:44,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-30 02:12:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 378 proven. 50 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2018-01-30 02:12:44,226 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:12:44,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2018-01-30 02:12:44,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 02:12:44,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 02:12:44,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-01-30 02:12:44,227 INFO L87 Difference]: Start difference. First operand 8236 states and 9319 transitions. Second operand 13 states. [2018-01-30 02:12:46,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:12:46,035 INFO L93 Difference]: Finished difference Result 30659 states and 34757 transitions. [2018-01-30 02:12:46,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-30 02:12:46,036 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 495 [2018-01-30 02:12:46,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:12:46,050 INFO L225 Difference]: With dead ends: 30659 [2018-01-30 02:12:46,050 INFO L226 Difference]: Without dead ends: 22525 [2018-01-30 02:12:46,059 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 501 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=306, Invalid=1254, Unknown=0, NotChecked=0, Total=1560 [2018-01-30 02:12:46,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22525 states. [2018-01-30 02:12:46,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22525 to 8269. [2018-01-30 02:12:46,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8269 states. [2018-01-30 02:12:46,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8269 states to 8269 states and 9342 transitions. [2018-01-30 02:12:46,265 INFO L78 Accepts]: Start accepts. Automaton has 8269 states and 9342 transitions. Word has length 495 [2018-01-30 02:12:46,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:12:46,266 INFO L432 AbstractCegarLoop]: Abstraction has 8269 states and 9342 transitions. [2018-01-30 02:12:46,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 02:12:46,266 INFO L276 IsEmpty]: Start isEmpty. Operand 8269 states and 9342 transitions. [2018-01-30 02:12:46,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2018-01-30 02:12:46,270 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:12:46,270 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:12:46,270 INFO L371 AbstractCegarLoop]: === Iteration 46 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:12:46,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1690683761, now seen corresponding path program 1 times [2018-01-30 02:12:46,271 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:12:46,271 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:12:46,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:46,271 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:46,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:12:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:46,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:12:46,630 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 397 proven. 37 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2018-01-30 02:12:46,630 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:12:46,630 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:12:46,635 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:12:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:12:46,697 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:12:46,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-30 02:12:46,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-30 02:12:46,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:46,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:46,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:46,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-01-30 02:12:46,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:12:46,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:12:46,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:46,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:46,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:46,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:12:47,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-30 02:12:47,107 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:47,126 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:47,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-30 02:12:47,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:47,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:47,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:47,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-30 02:12:47,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-30 02:12:47,310 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:47,310 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:12:47,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 02:12:47,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:47,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:47,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:47,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-01-30 02:12:47,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:12:47,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:12:47,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:47,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:47,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:47,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:12:47,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-30 02:12:47,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-30 02:12:47,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:12:47,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:47,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:12:47,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-30 02:12:47,462 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 396 proven. 38 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2018-01-30 02:12:47,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:12:47,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2018-01-30 02:12:47,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 02:12:47,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 02:12:47,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-01-30 02:12:47,481 INFO L87 Difference]: Start difference. First operand 8269 states and 9342 transitions. Second operand 13 states. Received shutdown request... [2018-01-30 02:12:48,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-30 02:12:48,454 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 02:12:48,457 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 02:12:48,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:12:48 BoogieIcfgContainer [2018-01-30 02:12:48,457 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 02:12:48,458 INFO L168 Benchmark]: Toolchain (without parser) took 63806.24 ms. Allocated memory was 149.4 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 112.5 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 472.7 MB. Max. memory is 5.3 GB. [2018-01-30 02:12:48,458 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 149.4 MB. Free memory is still 119.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 02:12:48,460 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.98 ms. Allocated memory is still 149.4 MB. Free memory was 112.3 MB in the beginning and 85.4 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 5.3 GB. [2018-01-30 02:12:48,460 INFO L168 Benchmark]: Boogie Preprocessor took 37.04 ms. Allocated memory is still 149.4 MB. Free memory was 85.4 MB in the beginning and 82.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 5.3 GB. [2018-01-30 02:12:48,460 INFO L168 Benchmark]: RCFGBuilder took 1375.58 ms. Allocated memory was 149.4 MB in the beginning and 170.4 MB in the end (delta: 21.0 MB). Free memory was 82.0 MB in the beginning and 114.0 MB in the end (delta: -32.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 5.3 GB. [2018-01-30 02:12:48,460 INFO L168 Benchmark]: TraceAbstraction took 62108.35 ms. Allocated memory was 170.4 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 114.0 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 453.2 MB. Max. memory is 5.3 GB. [2018-01-30 02:12:48,461 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.10 ms. Allocated memory is still 149.4 MB. Free memory is still 119.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 282.98 ms. Allocated memory is still 149.4 MB. Free memory was 112.3 MB in the beginning and 85.4 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.04 ms. Allocated memory is still 149.4 MB. Free memory was 85.4 MB in the beginning and 82.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 5.3 GB. * RCFGBuilder took 1375.58 ms. Allocated memory was 149.4 MB in the beginning and 170.4 MB in the end (delta: 21.0 MB). Free memory was 82.0 MB in the beginning and 114.0 MB in the end (delta: -32.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 62108.35 ms. Allocated memory was 170.4 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 114.0 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 453.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1644]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1644). Cancelled while BasicCegarLoop was constructing difference of abstraction (8269states) and interpolant automaton (currently 34 states, 13 states before enhancement), while ReachableStatesComputation was computing reachable states (3118 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 561 locations, 1 error locations. TIMEOUT Result, 62.0s OverallTime, 46 OverallIterations, 8 TraceHistogramMax, 36.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 41809 SDtfs, 32684 SDslu, 157169 SDs, 0 SdLazy, 50060 SolverSat, 2061 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7871 GetRequests, 7235 SyntacticMatches, 118 SemanticMatches, 518 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2713 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8269occurred in iteration=45, 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: 3.0s AutomataMinimizationTime, 45 MinimizatonAttempts, 154624 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 24818 NumberOfCodeBlocks, 24818 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 24757 ConstructedInterpolants, 0 QuantifiedInterpolants, 22915805 SizeOfPredicates, 84 NumberOfNonLiveVariables, 12459 ConjunctsInSsa, 233 ConjunctsInUnsatCore, 61 InterpolantComputations, 41 PerfectInterpolantSequences, 33239/34103 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt.blast.02_true-unreach-call.i.cil.c_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_02-12-48-464.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt.blast.02_true-unreach-call.i.cil.c_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_02-12-48-464.csv Completed graceful shutdown